/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:56:43,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:56:43,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:56:43,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:56:43,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:56:43,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:56:43,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:56:43,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:56:43,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:56:43,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:56:43,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:56:43,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:56:43,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:56:43,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:56:43,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:56:43,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:56:43,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:56:43,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:56:43,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:56:43,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:56:43,143 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:56:43,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:56:43,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:56:43,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:56:43,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:56:43,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:56:43,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:56:43,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:56:43,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:56:43,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:56:43,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:56:43,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:56:43,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:56:43,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:56:43,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:56:43,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:56:43,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:56:43,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:56:43,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:56:43,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:56:43,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:56:43,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:56:43,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:56:43,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:56:43,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:56:43,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:56:43,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:56:43,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:56:43,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:43,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:56:43,169 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 02:56:43,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:56:43,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:56:43,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:56:43,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:56:43,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:56:43,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-28 02:56:43,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b32a60/e9fcb6fbbd6849ebac3dc8405881a10a/FLAGa8ca31923 [2022-04-28 02:56:43,731 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:56:43,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-28 02:56:43,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b32a60/e9fcb6fbbd6849ebac3dc8405881a10a/FLAGa8ca31923 [2022-04-28 02:56:43,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93b32a60/e9fcb6fbbd6849ebac3dc8405881a10a [2022-04-28 02:56:43,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:56:43,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:56:43,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:43,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:56:43,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:56:43,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182872b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43, skipping insertion in model container [2022-04-28 02:56:43,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:56:43,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:56:43,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-28 02:56:43,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:43,915 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:56:43,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-28 02:56:43,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:43,936 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:56:43,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43 WrapperNode [2022-04-28 02:56:43,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:43,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:56:43,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:56:43,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:56:43,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:56:43,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:56:43,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:56:43,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:56:43,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (1/1) ... [2022-04-28 02:56:43,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:43,999 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-28 02:56:44,013 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-28 02:56:44,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:56:44,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:56:44,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:56:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:56:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:56:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:56:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:56:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:56:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:56:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:56:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:56:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:56:44,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:56:44,078 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:56:44,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:56:44,212 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:56:44,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:56:44,217 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:56:44,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:44 BoogieIcfgContainer [2022-04-28 02:56:44,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:56:44,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:56:44,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:56:44,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:56:44,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:56:43" (1/3) ... [2022-04-28 02:56:44,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35842748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:44, skipping insertion in model container [2022-04-28 02:56:44,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:43" (2/3) ... [2022-04-28 02:56:44,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35842748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:44, skipping insertion in model container [2022-04-28 02:56:44,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:44" (3/3) ... [2022-04-28 02:56:44,224 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2022-04-28 02:56:44,233 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:56:44,233 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:56:44,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:56:44,263 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27b867a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@402ddbaa [2022-04-28 02:56:44,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:56:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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-28 02:56:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:44,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:44,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:44,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 1 times [2022-04-28 02:56:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:44,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818790125] [2022-04-28 02:56:44,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 2 times [2022-04-28 02:56:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:44,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340500430] [2022-04-28 02:56:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 02:56:44,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 02:56:44,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-28 02:56:44,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:44,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 02:56:44,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 02:56:44,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-28 02:56:44,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2022-04-28 02:56:44,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-28 02:56:44,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-28 02:56:44,462 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-04-28 02:56:44,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 02:56:44,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 02:56:44,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 02:56:44,463 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-28 02:56:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:44,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340500430] [2022-04-28 02:56:44,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340500430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:44,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:44,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:44,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:44,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818790125] [2022-04-28 02:56:44,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818790125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:44,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:44,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108668889] [2022-04-28 02:56:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:44,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:44,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:44,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:44,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:56:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:56:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:44,506 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:44,622 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-28 02:56:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:56:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 02:56:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 02:56:44,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-28 02:56:44,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:44,710 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:56:44,710 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:56:44,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:44,718 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:44,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:56:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 02:56:44,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:44,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,747 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,747 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:44,754 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-28 02:56:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-28 02:56:44,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:44,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:44,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:56:44,755 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:56:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:44,757 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-28 02:56:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-28 02:56:44,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:44,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:44,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:44,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-28 02:56:44,768 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-28 02:56:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:44,768 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-28 02:56:44,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 32 transitions. [2022-04-28 02:56:44,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-28 02:56:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:44,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:44,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:44,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:56:44,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 1 times [2022-04-28 02:56:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630563819] [2022-04-28 02:56:44,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 2 times [2022-04-28 02:56:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:44,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770809552] [2022-04-28 02:56:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-28 02:56:44,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-28 02:56:44,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-28 02:56:44,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:44,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-28 02:56:44,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-28 02:56:44,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-28 02:56:44,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret6 := main(); {205#true} is VALID [2022-04-28 02:56:44,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {210#(= main_~x~0 0)} is VALID [2022-04-28 02:56:44,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {206#false} is VALID [2022-04-28 02:56:44,939 INFO L272 TraceCheckUtils]: 7: Hoare triple {206#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {206#false} is VALID [2022-04-28 02:56:44,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2022-04-28 02:56:44,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#false} assume 0 == ~cond; {206#false} is VALID [2022-04-28 02:56:44,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-04-28 02:56:44,940 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-28 02:56:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:44,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770809552] [2022-04-28 02:56:44,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770809552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:44,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:44,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:44,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630563819] [2022-04-28 02:56:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630563819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:44,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:44,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467159774] [2022-04-28 02:56:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:44,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:44,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:44,954 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,049 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-28 02:56:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:45,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-28 02:56:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-28 02:56:45,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-28 02:56:45,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,088 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:56:45,088 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:56:45,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:56:45,090 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:45,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:56:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 02:56:45,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:45,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,101 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,102 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,103 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-28 02:56:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-28 02:56:45,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:45,105 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,107 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-28 02:56:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-28 02:56:45,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:45,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-28 02:56:45,109 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-28 02:56:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:45,109 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-28 02:56:45,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 33 transitions. [2022-04-28 02:56:45,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-28 02:56:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:45,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:45,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:56:45,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 1 times [2022-04-28 02:56:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:45,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [605192209] [2022-04-28 02:56:45,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:45,203 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash 279245208, now seen corresponding path program 1 times [2022-04-28 02:56:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:45,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262904410] [2022-04-28 02:56:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-28 02:56:45,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 02:56:45,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-28 02:56:45,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:45,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-28 02:56:45,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 02:56:45,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-28 02:56:45,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret6 := main(); {368#true} is VALID [2022-04-28 02:56:45,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {373#(= main_~x~0 0)} is VALID [2022-04-28 02:56:45,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(= main_~x~0 0)} [100] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and (= v_main_~x~0_57 v_main_~x~0_46) .cse0) (and (= v_main_~x~0_46 v_main_~x~0_57) .cse0))) InVars {main_~x~0=v_main_~x~0_57, main_#t~post5=|v_main_#t~post5_4|} OutVars{main_~x~0=v_main_~x~0_46, main_#t~post5=|v_main_#t~post5_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {373#(= main_~x~0 0)} is VALID [2022-04-28 02:56:45,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(= main_~x~0 0)} [99] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {369#false} is VALID [2022-04-28 02:56:45,296 INFO L272 TraceCheckUtils]: 8: Hoare triple {369#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {369#false} is VALID [2022-04-28 02:56:45,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} ~cond := #in~cond; {369#false} is VALID [2022-04-28 02:56:45,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#false} assume 0 == ~cond; {369#false} is VALID [2022-04-28 02:56:45,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-28 02:56:45,297 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-28 02:56:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262904410] [2022-04-28 02:56:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262904410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:45,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:45,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:45,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [605192209] [2022-04-28 02:56:45,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [605192209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:45,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:45,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:56:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957325709] [2022-04-28 02:56:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:45,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:45,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:45,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 02:56:45,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:56:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:56:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:56:45,335 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 02:56:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,485 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2022-04-28 02:56:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:56:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 02:56:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 02:56:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 02:56:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 02:56:45,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 02:56:45,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,543 INFO L225 Difference]: With dead ends: 41 [2022-04-28 02:56:45,543 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:56:45,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:56:45,544 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:45,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 40 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:56:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 02:56:45,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:45,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,548 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,548 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,549 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2022-04-28 02:56:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2022-04-28 02:56:45,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:56:45,550 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:56:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,551 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2022-04-28 02:56:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2022-04-28 02:56:45,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:45,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-28 02:56:45,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 22 [2022-04-28 02:56:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:45,552 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-04-28 02:56:45,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-28 02:56:45,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 36 transitions. [2022-04-28 02:56:45,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2022-04-28 02:56:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:45,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:45,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:56:45,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 715396699, now seen corresponding path program 1 times [2022-04-28 02:56:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:45,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794067340] [2022-04-28 02:56:45,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:45,616 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 338350552, now seen corresponding path program 1 times [2022-04-28 02:56:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:45,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147835224] [2022-04-28 02:56:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {564#true} is VALID [2022-04-28 02:56:45,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-28 02:56:45,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} #96#return; {564#true} is VALID [2022-04-28 02:56:45,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:45,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {564#true} is VALID [2022-04-28 02:56:45,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-28 02:56:45,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} #96#return; {564#true} is VALID [2022-04-28 02:56:45,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} call #t~ret6 := main(); {564#true} is VALID [2022-04-28 02:56:45,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {569#(= main_~x~0 0)} is VALID [2022-04-28 02:56:45,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= main_~x~0 0)} [102] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_9| |v_main_#t~post5_8|))) (or (and (= v_main_~x~0_63 v_main_~x~0_74) .cse0) (and .cse0 (= v_main_~x~0_74 v_main_~x~0_63)))) InVars {main_~x~0=v_main_~x~0_74, main_#t~post5=|v_main_#t~post5_9|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post5=|v_main_#t~post5_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {569#(= main_~x~0 0)} is VALID [2022-04-28 02:56:45,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= main_~x~0 0)} [101] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-28 02:56:45,660 INFO L272 TraceCheckUtils]: 8: Hoare triple {565#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {565#false} is VALID [2022-04-28 02:56:45,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2022-04-28 02:56:45,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2022-04-28 02:56:45,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#false} assume !false; {565#false} is VALID [2022-04-28 02:56:45,661 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-28 02:56:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:45,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147835224] [2022-04-28 02:56:45,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147835224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:45,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:45,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:45,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:45,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794067340] [2022-04-28 02:56:45,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794067340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:45,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:45,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:56:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834243196] [2022-04-28 02:56:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:45,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:45,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:45,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 02:56:45,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:56:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:56:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:56:45,707 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 02:56:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,894 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2022-04-28 02:56:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:56:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 02:56:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 02:56:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 02:56:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 02:56:45,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 02:56:45,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,949 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:56:45,949 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 02:56:45,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:56:45,950 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:45,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 02:56:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 02:56:45,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:45,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,954 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,954 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,967 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-28 02:56:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-04-28 02:56:45,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 02:56:45,968 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 02:56:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,971 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-28 02:56:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-04-28 02:56:45,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:45,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-04-28 02:56:45,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 22 [2022-04-28 02:56:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:45,974 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-04-28 02:56:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-28 02:56:45,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 40 transitions. [2022-04-28 02:56:46,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-04-28 02:56:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:46,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:46,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:46,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:56:46,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 694793691, now seen corresponding path program 1 times [2022-04-28 02:56:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914397265] [2022-04-28 02:56:46,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:46,024 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 397455896, now seen corresponding path program 1 times [2022-04-28 02:56:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085926321] [2022-04-28 02:56:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:46,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {787#true} is VALID [2022-04-28 02:56:46,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 02:56:46,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {787#true} {787#true} #96#return; {787#true} is VALID [2022-04-28 02:56:46,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:46,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {787#true} is VALID [2022-04-28 02:56:46,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-28 02:56:46,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #96#return; {787#true} is VALID [2022-04-28 02:56:46,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret6 := main(); {787#true} is VALID [2022-04-28 02:56:46,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {792#(= main_~x~0 0)} is VALID [2022-04-28 02:56:46,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {792#(= main_~x~0 0)} [104] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (= v_main_~x~0_92 v_main_~x~0_81) .cse0) (and (= v_main_~x~0_81 v_main_~x~0_92) .cse0))) InVars {main_~x~0=v_main_~x~0_92, main_#t~post5=|v_main_#t~post5_14|} OutVars{main_~x~0=v_main_~x~0_81, main_#t~post5=|v_main_#t~post5_13|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {792#(= main_~x~0 0)} is VALID [2022-04-28 02:56:46,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {792#(= main_~x~0 0)} [103] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-28 02:56:46,082 INFO L272 TraceCheckUtils]: 8: Hoare triple {788#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {788#false} is VALID [2022-04-28 02:56:46,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-28 02:56:46,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-28 02:56:46,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-28 02:56:46,082 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-28 02:56:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085926321] [2022-04-28 02:56:46,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085926321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:46,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:46,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914397265] [2022-04-28 02:56:46,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914397265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313960519] [2022-04-28 02:56:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:46,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:46,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 02:56:46,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:56:46,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:56:46,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:56:46,164 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 02:56:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,433 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 02:56:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:46,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 02:56:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-28 02:56:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 02:56:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-28 02:56:46,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-28 02:56:46,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,487 INFO L225 Difference]: With dead ends: 47 [2022-04-28 02:56:46,488 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 02:56:46,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:56:46,488 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:46,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 02:56:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 02:56:46,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:46,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,492 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,492 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,493 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-28 02:56:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 02:56:46,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:46,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:46,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:56:46,494 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:56:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,495 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-28 02:56:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 02:56:46,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:46,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:46,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:46,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-28 02:56:46,496 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 22 [2022-04-28 02:56:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:46,496 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-28 02:56:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 02:56:46,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-28 02:56:46,525 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-28 02:56:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 02:56:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:46,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:46,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:46,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:56:46,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 565505435, now seen corresponding path program 1 times [2022-04-28 02:56:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683988161] [2022-04-28 02:56:46,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:46,563 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 456561240, now seen corresponding path program 1 times [2022-04-28 02:56:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:46,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720533435] [2022-04-28 02:56:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:46,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-28 02:56:46,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-28 02:56:46,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1025#true} {1025#true} #96#return; {1025#true} is VALID [2022-04-28 02:56:46,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:46,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-28 02:56:46,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-28 02:56:46,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #96#return; {1025#true} is VALID [2022-04-28 02:56:46,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2022-04-28 02:56:46,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1030#(= main_~x~0 0)} is VALID [2022-04-28 02:56:46,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(= main_~x~0 0)} [106] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (= v_main_~x~0_114 v_main_~x~0_103) .cse0) (and (= v_main_~x~0_103 v_main_~x~0_114) .cse0))) InVars {main_~x~0=v_main_~x~0_114, main_#t~post5=|v_main_#t~post5_19|} OutVars{main_~x~0=v_main_~x~0_103, main_#t~post5=|v_main_#t~post5_18|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1030#(= main_~x~0 0)} is VALID [2022-04-28 02:56:46,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(= main_~x~0 0)} [105] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1026#false} is VALID [2022-04-28 02:56:46,602 INFO L272 TraceCheckUtils]: 8: Hoare triple {1026#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1026#false} is VALID [2022-04-28 02:56:46,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-28 02:56:46,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1026#false} assume 0 == ~cond; {1026#false} is VALID [2022-04-28 02:56:46,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-28 02:56:46,603 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-28 02:56:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:46,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720533435] [2022-04-28 02:56:46,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720533435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:46,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683988161] [2022-04-28 02:56:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683988161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:56:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538740753] [2022-04-28 02:56:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:46,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:46,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-28 02:56:46,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:56:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:56:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:56:46,677 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-28 02:56:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,970 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2022-04-28 02:56:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:56:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-28 02:56:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-28 02:56:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-28 02:56:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-28 02:56:46,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-04-28 02:56:47,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:47,024 INFO L225 Difference]: With dead ends: 49 [2022-04-28 02:56:47,024 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 02:56:47,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:56:47,025 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:47,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 02:56:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 02:56:47,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:47,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,028 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,028 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:47,029 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 02:56:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 02:56:47,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:47,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:47,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 02:56:47,029 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 02:56:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:47,030 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 02:56:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 02:56:47,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:47,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:47,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:47,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-28 02:56:47,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2022-04-28 02:56:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-28 02:56:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-28 02:56:47,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-28 02:56:47,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 02:56:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:47,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:47,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:47,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:56:47,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 622763737, now seen corresponding path program 1 times [2022-04-28 02:56:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:47,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744160649] [2022-04-28 02:56:47,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:47,296 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash 515666584, now seen corresponding path program 1 times [2022-04-28 02:56:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396950799] [2022-04-28 02:56:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:47,307 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 4294967291) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_5 (* 4294967291 .v_it_5.0)) 4294967296)) 99) 0)) [2022-04-28 02:56:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:47,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:47,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396950799] [2022-04-28 02:56:47,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-28 02:56:47,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529375229] [2022-04-28 02:56:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:47,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:47,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:47,341 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-28 02:56:47,345 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-28 02:56:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:47,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:56:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:47,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:56,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1278#true} call ULTIMATE.init(); {1278#true} is VALID [2022-04-28 02:56:56,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1278#true} is VALID [2022-04-28 02:56:56,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} assume true; {1278#true} is VALID [2022-04-28 02:56:56,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1278#true} #96#return; {1278#true} is VALID [2022-04-28 02:56:56,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {1278#true} call #t~ret6 := main(); {1278#true} is VALID [2022-04-28 02:56:56,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1278#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1298#(= main_~x~0 0)} is VALID [2022-04-28 02:56:56,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#(= main_~x~0 0)} [108] L45-1-->L17-2_primed: Formula: (let ((.cse3 (= (mod v_main_~y~0_28 2) 0)) (.cse2 (< (mod v_main_~x~0_138 4294967296) 99)) (.cse0 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse1 (= v_main_~x~0_138 v_main_~x~0_128))) (or (and .cse0 .cse1 (= v_main_~y~0_28 v_main_~y~0_28)) (and (< 0 (div (+ v_main_~x~0_138 (* v_main_~x~0_128 (- 1))) 5)) (= 0 (mod (+ v_main_~x~0_138 (* v_main_~x~0_128 4)) 5)) (forall ((v_it_5 Int)) (or (< (mod (+ v_main_~x~0_138 (* v_it_5 4294967291)) 4294967296) 99) (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_138 (* v_main_~x~0_128 (- 1))) 5))))) .cse2 (not .cse3)) (and (or .cse3 (not .cse2)) .cse0 .cse1))) InVars {main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_138} OutVars{main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_128} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1302#(or (and (< 0 (div (* (- 1) main_~x~0) 5)) (not (= (mod main_~y~0 2) 0)) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 1) (div (* (- 1) main_~x~0) 5))) (< (mod (* v_it_5 4294967291) 4294967296) 99) (not (<= 1 v_it_5)))) (= (mod (* main_~x~0 4) 5) 0)) (= main_~x~0 0))} is VALID [2022-04-28 02:56:56,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1302#(or (and (< 0 (div (* (- 1) main_~x~0) 5)) (not (= (mod main_~y~0 2) 0)) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 1) (div (* (- 1) main_~x~0) 5))) (< (mod (* v_it_5 4294967291) 4294967296) 99) (not (<= 1 v_it_5)))) (= (mod (* main_~x~0 4) 5) 0)) (= main_~x~0 0))} [107] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1306#(and (< 0 (div (* (- 1) main_~x~0) 5)) (not (= (mod main_~y~0 2) 0)) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 1) (div (* (- 1) main_~x~0) 5))) (< (mod (* v_it_5 4294967291) 4294967296) 99) (not (<= 1 v_it_5)))) (= (mod (* main_~x~0 4) 5) 0))} is VALID [2022-04-28 02:56:56,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {1306#(and (< 0 (div (* (- 1) main_~x~0) 5)) (not (= (mod main_~y~0 2) 0)) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 1) (div (* (- 1) main_~x~0) 5))) (< (mod (* v_it_5 4294967291) 4294967296) 99) (not (<= 1 v_it_5)))) (= (mod (* main_~x~0 4) 5) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1310#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:56,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1314#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:56,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {1314#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1279#false} is VALID [2022-04-28 02:56:56,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-04-28 02:56:56,375 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-28 02:56:56,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:56:56,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529375229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:56,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:56,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:56,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744160649] [2022-04-28 02:56:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744160649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:56,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:56:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588374867] [2022-04-28 02:56:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:56,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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 22 [2022-04-28 02:56:56,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:56,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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-28 02:56:56,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:56:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:56:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:56,587 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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-28 02:56:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:56,903 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-28 02:56:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:56:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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 22 [2022-04-28 02:56:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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-28 02:56:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-28 02:56:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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-28 02:56:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-28 02:56:56,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-04-28 02:56:56,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:56,955 INFO L225 Difference]: With dead ends: 53 [2022-04-28 02:56:56,955 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:56:56,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:56:56,956 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:56,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-04-28 02:56:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:56:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 02:56:56,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:56,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:56,959 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:56,959 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:56,965 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-04-28 02:56:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-04-28 02:56:56,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:56,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:56,965 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:56,966 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-04-28 02:56:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-04-28 02:56:56,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:56,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:56,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:56,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-04-28 02:56:56,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 22 [2022-04-28 02:56:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:56,967 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-04-28 02:56:56,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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-28 02:56:56,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 34 transitions. [2022-04-28 02:56:56,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-04-28 02:56:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:56,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:56,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:57,003 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-28 02:56:57,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:57,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1288589669, now seen corresponding path program 1 times [2022-04-28 02:56:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:57,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000381632] [2022-04-28 02:56:57,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:57,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 574771928, now seen corresponding path program 1 times [2022-04-28 02:56:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:57,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247853141] [2022-04-28 02:56:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:57,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1530#true} is VALID [2022-04-28 02:56:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-28 02:56:57,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #96#return; {1530#true} is VALID [2022-04-28 02:56:57,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1530#true} is VALID [2022-04-28 02:56:57,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-28 02:56:57,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #96#return; {1530#true} is VALID [2022-04-28 02:56:57,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-28 02:56:57,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1535#(= main_~x~0 0)} is VALID [2022-04-28 02:56:57,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1535#(= main_~x~0 0)} [110] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_165 v_main_~x~0_154) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_154} AuxVars[] AssignedVars[main_~x~0] {1535#(= main_~x~0 0)} is VALID [2022-04-28 02:56:57,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#(= main_~x~0 0)} [109] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1531#false} is VALID [2022-04-28 02:56:57,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {1531#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1531#false} is VALID [2022-04-28 02:56:57,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2022-04-28 02:56:57,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2022-04-28 02:56:57,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-28 02:56:57,258 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-28 02:56:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247853141] [2022-04-28 02:56:57,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247853141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:57,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:57,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:57,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:57,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000381632] [2022-04-28 02:56:57,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000381632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:57,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:57,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:56:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713216621] [2022-04-28 02:56:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:57,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:57,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 02:56:57,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:57,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:56:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:56:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:57,365 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 02:56:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,850 INFO L93 Difference]: Finished difference Result 48 states and 76 transitions. [2022-04-28 02:56:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:56:57,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 02:56:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2022-04-28 02:56:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 02:56:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2022-04-28 02:56:57,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2022-04-28 02:56:57,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:57,913 INFO L225 Difference]: With dead ends: 48 [2022-04-28 02:56:57,913 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 02:56:57,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:56:57,914 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:57,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 02:56:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 02:56:57,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:57,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:57,917 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:57,917 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,918 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 02:56:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 02:56:57,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:57,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:57,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:56:57,918 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:56:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,919 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 02:56:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 02:56:57,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:57,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:57,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:57,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 02:56:57,920 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 22 [2022-04-28 02:56:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:57,920 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 02:56:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 02:56:57,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 02:56:57,952 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-28 02:56:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 02:56:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:57,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:57,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:56:57,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1231370265, now seen corresponding path program 1 times [2022-04-28 02:56:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:57,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081559513] [2022-04-28 02:56:58,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:58,146 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 633877272, now seen corresponding path program 1 times [2022-04-28 02:56:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:58,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441143926] [2022-04-28 02:56:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:58,154 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 20) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_5 (* 20 .v_it_7.0)) 4294967296)) 99) 0)) [2022-04-28 02:56:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:58,165 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 20) .v_it_7.1) (* 4294967296 (div (+ main_~x~0_5 (* 20 .v_it_7.1)) 4294967296)) 99) 0)) [2022-04-28 02:56:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:58,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1789#true} is VALID [2022-04-28 02:56:58,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-04-28 02:56:58,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1789#true} {1789#true} #96#return; {1789#true} is VALID [2022-04-28 02:56:58,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1789#true} call ULTIMATE.init(); {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:58,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1789#true} is VALID [2022-04-28 02:56:58,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} assume true; {1789#true} is VALID [2022-04-28 02:56:58,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1789#true} {1789#true} #96#return; {1789#true} is VALID [2022-04-28 02:56:58,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {1789#true} call #t~ret6 := main(); {1789#true} is VALID [2022-04-28 02:56:58,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1789#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1794#(= main_~x~0 0)} is VALID [2022-04-28 02:56:58,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {1794#(= main_~x~0 0)} [112] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_188 v_main_~x~0_178)) (.cse1 (< (mod v_main_~x~0_188 4294967296) 99)) (.cse2 (= (mod v_main_~y~0_31 2) 0))) (or (and .cse0 (= v_main_~y~0_31 v_main_~y~0_31)) (and (or (not .cse1) (not .cse2)) .cse0) (and .cse1 .cse2 (= (mod (+ v_main_~x~0_188 (* v_main_~x~0_178 19)) 20) 0) (forall ((v_it_7 Int)) (or (< (mod (+ v_main_~x~0_188 (* v_it_7 20)) 4294967296) 99) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_188 (* v_main_~x~0_178 (- 1))) (- 20)))) (not (<= 1 v_it_7)))) (< 0 (div (+ v_main_~x~0_188 (* v_main_~x~0_178 (- 1))) (- 20)))))) InVars {main_~x~0=v_main_~x~0_188, main_~y~0=v_main_~y~0_31} OutVars{main_~x~0=v_main_~x~0_178, main_~y~0=v_main_~y~0_31} AuxVars[] AssignedVars[main_~x~0] {1795#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:56:58,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [111] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1796#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:56:58,254 INFO L272 TraceCheckUtils]: 8: Hoare triple {1796#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1797#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:56:58,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {1797#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1798#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:58,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {1798#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1790#false} is VALID [2022-04-28 02:56:58,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#false} assume !false; {1790#false} is VALID [2022-04-28 02:56:58,255 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-28 02:56:58,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441143926] [2022-04-28 02:56:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441143926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:58,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:57:13,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081559513] [2022-04-28 02:57:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081559513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:57:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092399825] [2022-04-28 02:57:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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 22 [2022-04-28 02:57:13,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:13,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-28 02:57:13,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:13,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:57:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:57:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=314, Unknown=2, NotChecked=0, Total=380 [2022-04-28 02:57:13,584 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-28 02:57:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,805 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-28 02:57:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:57:13,805 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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 22 [2022-04-28 02:57:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-28 02:57:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-28 02:57:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-28 02:57:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-28 02:57:13,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2022-04-28 02:57:13,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:13,919 INFO L225 Difference]: With dead ends: 47 [2022-04-28 02:57:13,919 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 02:57:13,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=79, Invalid=425, Unknown=2, NotChecked=0, Total=506 [2022-04-28 02:57:13,920 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 97 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 343 Unchecked, 0.0s Time] [2022-04-28 02:57:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 02:57:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-04-28 02:57:13,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:13,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,954 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,955 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,956 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-28 02:57:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2022-04-28 02:57:13,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:13,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:13,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:57:13,956 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:57:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,957 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-28 02:57:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2022-04-28 02:57:13,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:13,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:13,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:13,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-28 02:57:13,959 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 22 [2022-04-28 02:57:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:13,959 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-28 02:57:13,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-28 02:57:13,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-28 02:57:14,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 02:57:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:57:14,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:14,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:14,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:57:14,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1288628567, now seen corresponding path program 1 times [2022-04-28 02:57:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:14,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364404087] [2022-04-28 02:57:14,026 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:14,026 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 692982616, now seen corresponding path program 1 times [2022-04-28 02:57:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222512956] [2022-04-28 02:57:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:14,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {2072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2066#true} is VALID [2022-04-28 02:57:14,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2066#true} assume true; {2066#true} is VALID [2022-04-28 02:57:14,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2066#true} {2066#true} #96#return; {2066#true} is VALID [2022-04-28 02:57:14,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2066#true} call ULTIMATE.init(); {2072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:14,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2066#true} is VALID [2022-04-28 02:57:14,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2066#true} assume true; {2066#true} is VALID [2022-04-28 02:57:14,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2066#true} {2066#true} #96#return; {2066#true} is VALID [2022-04-28 02:57:14,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {2066#true} call #t~ret6 := main(); {2066#true} is VALID [2022-04-28 02:57:14,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {2066#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2071#(= main_~x~0 0)} is VALID [2022-04-28 02:57:14,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#(= main_~x~0 0)} [114] L45-1-->L17-2_primed: Formula: (or (= v_main_~x~0_203 v_main_~x~0_214) (= v_main_~x~0_214 v_main_~x~0_203)) InVars {main_~x~0=v_main_~x~0_214} OutVars{main_~x~0=v_main_~x~0_203} AuxVars[] AssignedVars[main_~x~0] {2071#(= main_~x~0 0)} is VALID [2022-04-28 02:57:14,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#(= main_~x~0 0)} [113] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2067#false} is VALID [2022-04-28 02:57:14,090 INFO L272 TraceCheckUtils]: 8: Hoare triple {2067#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2067#false} is VALID [2022-04-28 02:57:14,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {2067#false} ~cond := #in~cond; {2067#false} is VALID [2022-04-28 02:57:14,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#false} assume 0 == ~cond; {2067#false} is VALID [2022-04-28 02:57:14,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {2067#false} assume !false; {2067#false} is VALID [2022-04-28 02:57:14,090 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-28 02:57:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222512956] [2022-04-28 02:57:14,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222512956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:14,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:14,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:14,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:14,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364404087] [2022-04-28 02:57:14,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364404087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:14,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:14,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:57:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131966321] [2022-04-28 02:57:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-28 02:57:14,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:14,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 02:57:14,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:14,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:57:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:57:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:57:14,222 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 02:57:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:14,771 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-28 02:57:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:57:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-28 02:57:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 02:57:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-04-28 02:57:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 02:57:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-04-28 02:57:14,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 70 transitions. [2022-04-28 02:57:14,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:14,820 INFO L225 Difference]: With dead ends: 50 [2022-04-28 02:57:14,820 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:57:14,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:57:14,821 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:14,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:57:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 02:57:14,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:14,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:14,841 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:14,842 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:14,842 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 02:57:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-28 02:57:14,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:14,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:14,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:57:14,843 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:57:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:14,843 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 02:57:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-28 02:57:14,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:14,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:14,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:14,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-04-28 02:57:14,844 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2022-04-28 02:57:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:14,844 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-04-28 02:57:14,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 02:57:14,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 44 transitions. [2022-04-28 02:57:14,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-28 02:57:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:57:14,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:14,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:14,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:57:14,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -830077758, now seen corresponding path program 1 times [2022-04-28 02:57:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:14,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704941805] [2022-04-28 02:57:14,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:15,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:15,129 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -571494889, now seen corresponding path program 1 times [2022-04-28 02:57:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890081246] [2022-04-28 02:57:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:15,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_10.0) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_10.0)) 4294967296)) 99) 0)) [2022-04-28 02:57:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,151 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_10.1) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_10.1)) 4294967296)) 99) 0)) [2022-04-28 02:57:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {2350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-28 02:57:15,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-28 02:57:15,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2340#true} {2340#true} #96#return; {2340#true} is VALID [2022-04-28 02:57:15,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:15,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-28 02:57:15,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-28 02:57:15,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #96#return; {2340#true} is VALID [2022-04-28 02:57:15,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret6 := main(); {2340#true} is VALID [2022-04-28 02:57:15,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:15,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {2345#(= main_~x~0 0)} [116] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_250 v_main_~x~0_228))) (or (and .cse0 (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse0 (= |v_main_#t~post5_30| |v_main_#t~post5_29|)))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post5=|v_main_#t~post5_30|} OutVars{main_~x~0=v_main_~x~0_228, main_#t~post5=|v_main_#t~post5_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:15,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {2345#(= main_~x~0 0)} [117] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:15,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2345#(= main_~x~0 0)} [118] L45-1-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_249 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_35 2) 0))) (or (and (< 0 (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20))) .cse0 (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (+ v_main_~x~0_249 (* v_it_10 20)) 4294967296) 99) (not (<= (+ v_it_10 1) (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20)))))) (= (mod (+ v_main_~x~0_249 (* v_main_~x~0_239 19)) 20) 0) .cse1) (and (= v_main_~x~0_239 v_main_~x~0_249) (or (not .cse0) (not .cse1))) (and (= v_main_~y~0_35 v_main_~y~0_35) (= v_main_~x~0_249 v_main_~x~0_239)))) InVars {main_~x~0=v_main_~x~0_249, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_239, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[main_~x~0] {2346#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:57:15,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [115] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2347#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:57:15,250 INFO L272 TraceCheckUtils]: 10: Hoare triple {2347#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:57:15,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {2348#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2349#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:57:15,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2349#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2341#false} is VALID [2022-04-28 02:57:15,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-28 02:57:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:15,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890081246] [2022-04-28 02:57:15,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890081246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:15,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282872791] [2022-04-28 02:57:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:15,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:15,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:15,252 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-28 02:57:15,253 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-28 02:57:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:57:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:19,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2340#true} is VALID [2022-04-28 02:57:19,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-28 02:57:19,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-28 02:57:19,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #96#return; {2340#true} is VALID [2022-04-28 02:57:19,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret6 := main(); {2340#true} is VALID [2022-04-28 02:57:19,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:19,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {2345#(= main_~x~0 0)} [116] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_250 v_main_~x~0_228))) (or (and .cse0 (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse0 (= |v_main_#t~post5_30| |v_main_#t~post5_29|)))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post5=|v_main_#t~post5_30|} OutVars{main_~x~0=v_main_~x~0_228, main_#t~post5=|v_main_#t~post5_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:19,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {2345#(= main_~x~0 0)} [117] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2345#(= main_~x~0 0)} is VALID [2022-04-28 02:57:19,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {2345#(= main_~x~0 0)} [118] L45-1-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_249 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_35 2) 0))) (or (and (< 0 (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20))) .cse0 (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (+ v_main_~x~0_249 (* v_it_10 20)) 4294967296) 99) (not (<= (+ v_it_10 1) (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20)))))) (= (mod (+ v_main_~x~0_249 (* v_main_~x~0_239 19)) 20) 0) .cse1) (and (= v_main_~x~0_239 v_main_~x~0_249) (or (not .cse0) (not .cse1))) (and (= v_main_~y~0_35 v_main_~y~0_35) (= v_main_~x~0_249 v_main_~x~0_239)))) InVars {main_~x~0=v_main_~x~0_249, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_239, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[main_~x~0] {2378#(or (= main_~x~0 0) (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (* v_it_10 20) 4294967296) 99) (not (<= (+ v_it_10 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:57:19,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {2378#(or (= main_~x~0 0) (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (* v_it_10 20) 4294967296) 99) (not (<= (+ v_it_10 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} [115] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2382#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (* v_it_10 20) 4294967296) 99) (not (<= (+ v_it_10 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:57:19,623 INFO L272 TraceCheckUtils]: 10: Hoare triple {2382#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (* v_it_10 20) 4294967296) 99) (not (<= (+ v_it_10 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:19,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {2386#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:19,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {2390#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2341#false} is VALID [2022-04-28 02:57:19,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-28 02:57:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:19,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:27,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-28 02:57:27,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {2390#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2341#false} is VALID [2022-04-28 02:57:27,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {2386#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:27,047 INFO L272 TraceCheckUtils]: 10: Hoare triple {2347#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:27,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {2409#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [115] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2347#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:57:28,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [118] L45-1-->L17-2_primed: Formula: (let ((.cse0 (< (mod v_main_~x~0_249 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_35 2) 0))) (or (and (< 0 (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20))) .cse0 (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< (mod (+ v_main_~x~0_249 (* v_it_10 20)) 4294967296) 99) (not (<= (+ v_it_10 1) (div (+ (* v_main_~x~0_239 (- 1)) v_main_~x~0_249) (- 20)))))) (= (mod (+ v_main_~x~0_249 (* v_main_~x~0_239 19)) 20) 0) .cse1) (and (= v_main_~x~0_239 v_main_~x~0_249) (or (not .cse0) (not .cse1))) (and (= v_main_~y~0_35 v_main_~y~0_35) (= v_main_~x~0_249 v_main_~x~0_239)))) InVars {main_~x~0=v_main_~x~0_249, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_239, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[main_~x~0] {2409#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:57:28,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [117] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:28,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [116] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_250 v_main_~x~0_228))) (or (and .cse0 (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse0 (= |v_main_#t~post5_30| |v_main_#t~post5_29|)))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post5=|v_main_#t~post5_30|} OutVars{main_~x~0=v_main_~x~0_228, main_#t~post5=|v_main_#t~post5_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:28,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2413#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 Int) (aux_div_v_main_~x~0_258_32 Int)) (or (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58)) (<= (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 0) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122 20)) (+ (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58) (* 4294967296 aux_div_v_main_~x~0_258_32) 99)) (exists ((v_it_10 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_10 20)) 4294967296) 99)) (<= 1 v_it_10) (<= (+ v_it_10 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_258_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_258_32_80_122))))) (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:28,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret6 := main(); {2340#true} is VALID [2022-04-28 02:57:28,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #96#return; {2340#true} is VALID [2022-04-28 02:57:28,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-28 02:57:28,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-28 02:57:28,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2340#true} is VALID [2022-04-28 02:57:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:28,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282872791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:28,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:28,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:57:28,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704941805] [2022-04-28 02:57:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704941805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:57:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074714460] [2022-04-28 02:57:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:57:28,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:28,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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-28 02:57:28,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:57:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:57:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:57:28,850 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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-28 02:57:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,735 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2022-04-28 02:57:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:57:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:57:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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-28 02:57:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2022-04-28 02:57:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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-28 02:57:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2022-04-28 02:57:29,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 97 transitions. [2022-04-28 02:57:29,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:29,812 INFO L225 Difference]: With dead ends: 65 [2022-04-28 02:57:29,812 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 02:57:29,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:57:29,813 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:29,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 02:57:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 02:57:29,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:29,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,864 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,864 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,865 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-28 02:57:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-28 02:57:29,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:29,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:29,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:57:29,865 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:57:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,866 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-28 02:57:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-28 02:57:29,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:29,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:29,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:29,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-04-28 02:57:29,867 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 33 [2022-04-28 02:57:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:29,868 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-04-28 02:57:29,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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-28 02:57:29,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 66 transitions. [2022-04-28 02:57:29,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-28 02:57:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 02:57:29,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:29,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:29,943 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-28 02:57:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 02:57:30,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1975598651, now seen corresponding path program 2 times [2022-04-28 02:57:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501749971] [2022-04-28 02:57:30,164 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:30,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:30,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:30,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1063399914, now seen corresponding path program 1 times [2022-04-28 02:57:30,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:30,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651873121] [2022-04-28 02:57:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:30,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_13.0) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_13.0)) 4294967296)) 99) 0)) [2022-04-28 02:57:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:30,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_13.1) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_13.1)) 4294967296)) 99) 0)) [2022-04-28 02:57:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:30,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {2802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:30,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {2802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 02:57:30,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret6 := main(); {2792#true} is VALID [2022-04-28 02:57:30,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:30,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {2797#(= main_~x~0 0)} [120] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_307 v_main_~x~0_274) (= |v_main_#t~post5_37| |v_main_#t~post5_36|)) InVars {main_~x~0=v_main_~x~0_307, main_#t~post5=|v_main_#t~post5_37|} OutVars{main_~x~0=v_main_~x~0_274, main_#t~post5=|v_main_#t~post5_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:30,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2797#(= main_~x~0 0)} [121] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:30,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2797#(= main_~x~0 0)} [122] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_310 v_main_~x~0_285) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_285} AuxVars[] AssignedVars[main_~x~0] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:30,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2797#(= main_~x~0 0)} [123] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:30,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {2797#(= main_~x~0 0)} [124] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_40 2) 0)) (.cse2 (< (mod v_main_~x~0_306 4294967296) 99)) (.cse0 (= v_main_~x~0_306 v_main_~x~0_296))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and (< 0 (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20))) .cse1 (forall ((v_it_13 Int)) (or (not (<= (+ v_it_13 1) (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20)))) (not (<= 1 v_it_13)) (< (mod (+ v_main_~x~0_306 (* v_it_13 20)) 4294967296) 99))) .cse2 (= (mod (+ v_main_~x~0_306 (* v_main_~x~0_296 19)) 20) 0)) (and (= v_main_~y~0_40 v_main_~y~0_40) .cse0))) InVars {main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[main_~x~0] {2798#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:57:30,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {2798#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [119] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2799#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)) (not (= main_~x~0 0)))} is VALID [2022-04-28 02:57:30,454 INFO L272 TraceCheckUtils]: 12: Hoare triple {2799#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)) (not (= main_~x~0 0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:57:30,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2801#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:57:30,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {2801#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2793#false} is VALID [2022-04-28 02:57:30,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-28 02:57:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:57:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:30,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651873121] [2022-04-28 02:57:30,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651873121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:30,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725461058] [2022-04-28 02:57:30,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:30,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:30,456 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-28 02:57:30,457 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-28 02:57:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:30,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:57:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:30,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:31,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-28 02:57:31,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2792#true} is VALID [2022-04-28 02:57:31,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 02:57:31,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 02:57:31,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret6 := main(); {2792#true} is VALID [2022-04-28 02:57:31,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:31,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {2797#(= main_~x~0 0)} [120] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_307 v_main_~x~0_274) (= |v_main_#t~post5_37| |v_main_#t~post5_36|)) InVars {main_~x~0=v_main_~x~0_307, main_#t~post5=|v_main_#t~post5_37|} OutVars{main_~x~0=v_main_~x~0_274, main_#t~post5=|v_main_#t~post5_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:31,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2797#(= main_~x~0 0)} [121] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:31,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {2797#(= main_~x~0 0)} [122] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_310 v_main_~x~0_285) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_285} AuxVars[] AssignedVars[main_~x~0] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:31,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {2797#(= main_~x~0 0)} [123] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(= main_~x~0 0)} is VALID [2022-04-28 02:57:31,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {2797#(= main_~x~0 0)} [124] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_40 2) 0)) (.cse2 (< (mod v_main_~x~0_306 4294967296) 99)) (.cse0 (= v_main_~x~0_306 v_main_~x~0_296))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and (< 0 (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20))) .cse1 (forall ((v_it_13 Int)) (or (not (<= (+ v_it_13 1) (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20)))) (not (<= 1 v_it_13)) (< (mod (+ v_main_~x~0_306 (* v_it_13 20)) 4294967296) 99))) .cse2 (= (mod (+ v_main_~x~0_306 (* v_main_~x~0_296 19)) 20) 0)) (and (= v_main_~y~0_40 v_main_~y~0_40) .cse0))) InVars {main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[main_~x~0] {2836#(or (= main_~x~0 0) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_13 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:57:31,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {2836#(or (= main_~x~0 0) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_13 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} [119] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2840#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_13 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:57:31,236 INFO L272 TraceCheckUtils]: 12: Hoare triple {2840#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_13 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:31,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:31,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {2848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-28 02:57:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-28 02:57:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:57:31,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:43,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-28 02:57:43,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-28 02:57:43,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:43,283 INFO L272 TraceCheckUtils]: 12: Hoare triple {2864#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:43,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {2868#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} [119] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2864#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 02:57:43,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} [124] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_40 2) 0)) (.cse2 (< (mod v_main_~x~0_306 4294967296) 99)) (.cse0 (= v_main_~x~0_306 v_main_~x~0_296))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and (< 0 (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20))) .cse1 (forall ((v_it_13 Int)) (or (not (<= (+ v_it_13 1) (div (+ v_main_~x~0_306 (* v_main_~x~0_296 (- 1))) (- 20)))) (not (<= 1 v_it_13)) (< (mod (+ v_main_~x~0_306 (* v_it_13 20)) 4294967296) 99))) .cse2 (= (mod (+ v_main_~x~0_306 (* v_main_~x~0_296 19)) 20) 0)) (and (= v_main_~y~0_40 v_main_~y~0_40) .cse0))) InVars {main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[main_~x~0] {2868#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 02:57:43,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} [123] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} is VALID [2022-04-28 02:57:43,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} [122] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_310 v_main_~x~0_285) InVars {main_~x~0=v_main_~x~0_310} OutVars{main_~x~0=v_main_~x~0_285} AuxVars[] AssignedVars[main_~x~0] {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} is VALID [2022-04-28 02:57:43,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} [121] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} is VALID [2022-04-28 02:57:43,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} [120] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_307 v_main_~x~0_274) (= |v_main_#t~post5_37| |v_main_#t~post5_36|)) InVars {main_~x~0=v_main_~x~0_307, main_#t~post5=|v_main_#t~post5_37|} OutVars{main_~x~0=v_main_~x~0_274, main_#t~post5=|v_main_#t~post5_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} is VALID [2022-04-28 02:57:43,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2872#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (+ (- 1) main_~x~0) 2) (div (+ (- 2) main_~x~0) 2)) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 Int) (aux_div_v_main_~x~0_319_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 Int)) (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ v_it_13 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168) (not (< (mod (+ main_~x~0 (* v_it_13 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0)) (<= 20 (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58)) (< (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 0) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_319_32_34_168 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_319_32) (* 20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_319_32_34_168_58) 99))))))} is VALID [2022-04-28 02:57:43,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret6 := main(); {2792#true} is VALID [2022-04-28 02:57:43,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 02:57:43,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 02:57:43,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2792#true} is VALID [2022-04-28 02:57:43,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-28 02:57:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:57:43,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725461058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:43,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:43,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-28 02:57:43,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501749971] [2022-04-28 02:57:43,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501749971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:43,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:43,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 02:57:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315211972] [2022-04-28 02:57:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 44 [2022-04-28 02:57:43,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:43,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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-28 02:57:43,836 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-28 02:57:43,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 02:57:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 02:57:43,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 02:57:43,837 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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-28 02:57:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,273 INFO L93 Difference]: Finished difference Result 84 states and 134 transitions. [2022-04-28 02:57:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:57:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 44 [2022-04-28 02:57:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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-28 02:57:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2022-04-28 02:57:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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-28 02:57:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2022-04-28 02:57:45,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 92 transitions. [2022-04-28 02:57:45,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:45,368 INFO L225 Difference]: With dead ends: 84 [2022-04-28 02:57:45,368 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 02:57:45,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=370, Invalid=2386, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 02:57:45,369 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:45,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:57:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 02:57:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-04-28 02:57:45,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:45,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,424 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,424 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,428 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-28 02:57:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-28 02:57:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:45,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:45,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 02:57:45,428 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 02:57:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,430 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-28 02:57:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-28 02:57:45,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:45,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:45,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:45,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2022-04-28 02:57:45,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 44 [2022-04-28 02:57:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:45,433 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2022-04-28 02:57:45,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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-28 02:57:45,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 74 transitions. [2022-04-28 02:57:45,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-28 02:57:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 02:57:45,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:45,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:45,518 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-28 02:57:45,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:45,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -325223939, now seen corresponding path program 3 times [2022-04-28 02:57:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:45,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208191439] [2022-04-28 02:57:45,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:46,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:46,071 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 257368215, now seen corresponding path program 1 times [2022-04-28 02:57:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:46,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745361453] [2022-04-28 02:57:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:46,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_15.0) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_15.0)) 4294967296)) 99) 0)) [2022-04-28 02:57:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,089 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_15.1) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_15.1)) 4294967296)) 99) 0)) [2022-04-28 02:57:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {3363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 02:57:46,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 02:57:46,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3353#true} {3353#true} #96#return; {3353#true} is VALID [2022-04-28 02:57:46,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:46,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 02:57:46,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 02:57:46,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #96#return; {3353#true} is VALID [2022-04-28 02:57:46,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret6 := main(); {3353#true} is VALID [2022-04-28 02:57:46,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:46,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#(= main_~x~0 0)} [126] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_43| |v_main_#t~post5_42|) (= v_main_~x~0_366 v_main_~x~0_344)) InVars {main_~x~0=v_main_~x~0_366, main_#t~post5=|v_main_#t~post5_43|} OutVars{main_~x~0=v_main_~x~0_344, main_#t~post5=|v_main_#t~post5_42|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:46,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {3358#(= main_~x~0 0)} [127] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:46,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {3358#(= main_~x~0 0)} [128] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_365 v_main_~x~0_355)) (.cse1 (< (mod v_main_~x~0_365 4294967296) 99)) (.cse2 (= (mod v_main_~y~0_44 2) 0))) (or (and .cse0 (= v_main_~y~0_44 v_main_~y~0_44)) (and .cse0 (or (not .cse1) (not .cse2))) (and (= (mod (+ v_main_~x~0_365 (* v_main_~x~0_355 19)) 20) 0) .cse1 (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_365 (* v_it_15 20)) 4294967296) 99) (not (<= 1 v_it_15)))) .cse2 (< 0 (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))))) InVars {main_~x~0=v_main_~x~0_365, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_355, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[main_~x~0] {3359#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:57:46,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [125] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3360#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)) (not (= main_~x~0 0)))} is VALID [2022-04-28 02:57:46,205 INFO L272 TraceCheckUtils]: 10: Hoare triple {3360#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)) (not (= main_~x~0 0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:57:46,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3362#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:57:46,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 02:57:46,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 02:57:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745361453] [2022-04-28 02:57:46,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745361453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049202467] [2022-04-28 02:57:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:46,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:46,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:57:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:57:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:49,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 02:57:49,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 02:57:49,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 02:57:49,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #96#return; {3353#true} is VALID [2022-04-28 02:57:49,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret6 := main(); {3353#true} is VALID [2022-04-28 02:57:49,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:49,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#(= main_~x~0 0)} [126] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_43| |v_main_#t~post5_42|) (= v_main_~x~0_366 v_main_~x~0_344)) InVars {main_~x~0=v_main_~x~0_366, main_#t~post5=|v_main_#t~post5_43|} OutVars{main_~x~0=v_main_~x~0_344, main_#t~post5=|v_main_#t~post5_42|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:49,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {3358#(= main_~x~0 0)} [127] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3358#(= main_~x~0 0)} is VALID [2022-04-28 02:57:49,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {3358#(= main_~x~0 0)} [128] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_365 v_main_~x~0_355)) (.cse1 (< (mod v_main_~x~0_365 4294967296) 99)) (.cse2 (= (mod v_main_~y~0_44 2) 0))) (or (and .cse0 (= v_main_~y~0_44 v_main_~y~0_44)) (and .cse0 (or (not .cse1) (not .cse2))) (and (= (mod (+ v_main_~x~0_365 (* v_main_~x~0_355 19)) 20) 0) .cse1 (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_365 (* v_it_15 20)) 4294967296) 99) (not (<= 1 v_it_15)))) .cse2 (< 0 (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))))) InVars {main_~x~0=v_main_~x~0_365, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_355, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[main_~x~0] {3391#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_15 Int)) (or (< (mod (* v_it_15 20) 4294967296) 99) (not (<= (+ v_it_15 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_15))))))} is VALID [2022-04-28 02:57:49,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {3391#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_15 Int)) (or (< (mod (* v_it_15 20) 4294967296) 99) (not (<= (+ v_it_15 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_15))))))} [125] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3395#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_15 Int)) (or (< (mod (* v_it_15 20) 4294967296) 99) (not (<= (+ v_it_15 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_15)))) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:57:49,698 INFO L272 TraceCheckUtils]: 10: Hoare triple {3395#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_15 Int)) (or (< (mod (* v_it_15 20) 4294967296) 99) (not (<= (+ v_it_15 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_15)))) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:49,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {3399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:49,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {3403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 02:57:49,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 02:57:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:49,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:57,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 02:57:57,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {3403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 02:57:57,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {3399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:57,946 INFO L272 TraceCheckUtils]: 10: Hoare triple {3419#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:57,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {3423#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} [125] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3419#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 02:57:59,956 WARN L290 TraceCheckUtils]: 8: Hoare triple {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [128] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_365 v_main_~x~0_355)) (.cse1 (< (mod v_main_~x~0_365 4294967296) 99)) (.cse2 (= (mod v_main_~y~0_44 2) 0))) (or (and .cse0 (= v_main_~y~0_44 v_main_~y~0_44)) (and .cse0 (or (not .cse1) (not .cse2))) (and (= (mod (+ v_main_~x~0_365 (* v_main_~x~0_355 19)) 20) 0) .cse1 (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_365 (* v_it_15 20)) 4294967296) 99) (not (<= 1 v_it_15)))) .cse2 (< 0 (div (+ v_main_~x~0_365 (* v_main_~x~0_355 (- 1))) (- 20)))))) InVars {main_~x~0=v_main_~x~0_365, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_355, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[main_~x~0] {3423#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is UNKNOWN [2022-04-28 02:57:59,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [127] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:59,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [126] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_43| |v_main_#t~post5_42|) (= v_main_~x~0_366 v_main_~x~0_344)) InVars {main_~x~0=v_main_~x~0_366, main_#t~post5=|v_main_#t~post5_43|} OutVars{main_~x~0=v_main_~x~0_344, main_#t~post5=|v_main_#t~post5_42|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:59,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3427#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 Int) (aux_div_v_main_~x~0_374_32 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 v_it_15 1) aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168) (not (< (mod (+ (* v_it_15 20) main_~x~0) 4294967296) 99)))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 0) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_374_32_34_168 20)) (+ (* 4294967296 aux_div_v_main_~x~0_374_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_374_32_34_168_58 20) 99)))) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 02:57:59,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret6 := main(); {3353#true} is VALID [2022-04-28 02:57:59,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #96#return; {3353#true} is VALID [2022-04-28 02:57:59,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 02:57:59,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 02:57:59,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 02:57:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:57:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049202467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:59,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:59,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-28 02:58:00,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:00,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208191439] [2022-04-28 02:58:00,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208191439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:00,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:00,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 02:58:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171319989] [2022-04-28 02:58:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:00,514 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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 44 [2022-04-28 02:58:00,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:00,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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-28 02:58:00,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 02:58:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 02:58:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1001, Unknown=1, NotChecked=0, Total=1190 [2022-04-28 02:58:00,545 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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-28 02:58:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:02,423 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-28 02:58:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 02:58:02,423 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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 44 [2022-04-28 02:58:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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-28 02:58:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 105 transitions. [2022-04-28 02:58:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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-28 02:58:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 105 transitions. [2022-04-28 02:58:02,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 105 transitions. [2022-04-28 02:58:02,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:02,509 INFO L225 Difference]: With dead ends: 95 [2022-04-28 02:58:02,509 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 02:58:02,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=405, Invalid=2786, Unknown=1, NotChecked=0, Total=3192 [2022-04-28 02:58:02,510 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:02,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 62 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 02:58:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 02:58:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-28 02:58:02,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:02,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,557 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,557 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:02,559 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-28 02:58:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-28 02:58:02,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:02,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:02,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:58:02,559 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:58:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:02,560 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-28 02:58:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-28 02:58:02,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:02,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:02,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:02,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-04-28 02:58:02,561 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 44 [2022-04-28 02:58:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:02,561 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-04-28 02:58:02,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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-28 02:58:02,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 77 transitions. [2022-04-28 02:58:02,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-04-28 02:58:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 02:58:02,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:02,654 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:02,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 02:58:02,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:02,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1775224352, now seen corresponding path program 4 times [2022-04-28 02:58:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:02,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277518630] [2022-04-28 02:58:02,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:02,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:03,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:03,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1200619990, now seen corresponding path program 1 times [2022-04-28 02:58:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730043878] [2022-04-28 02:58:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:03,086 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_18.0) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_18.0)) 4294967296)) 99) 0)) [2022-04-28 02:58:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,097 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_18.1) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_18.1)) 4294967296)) 99) 0)) [2022-04-28 02:58:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {3968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3958#true} is VALID [2022-04-28 02:58:03,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-04-28 02:58:03,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3958#true} {3958#true} #96#return; {3958#true} is VALID [2022-04-28 02:58:03,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {3958#true} call ULTIMATE.init(); {3968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:03,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {3968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3958#true} is VALID [2022-04-28 02:58:03,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-04-28 02:58:03,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3958#true} {3958#true} #96#return; {3958#true} is VALID [2022-04-28 02:58:03,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {3958#true} call #t~ret6 := main(); {3958#true} is VALID [2022-04-28 02:58:03,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {3958#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:03,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {3963#(= main_~x~0 0)} [130] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_49| |v_main_#t~post5_48|) (= v_main_~x~0_433 v_main_~x~0_400)) InVars {main_~x~0=v_main_~x~0_433, main_#t~post5=|v_main_#t~post5_49|} OutVars{main_~x~0=v_main_~x~0_400, main_#t~post5=|v_main_#t~post5_48|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:03,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(= main_~x~0 0)} [131] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:03,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {3963#(= main_~x~0 0)} [132] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_436 v_main_~x~0_411) InVars {main_~x~0=v_main_~x~0_436} OutVars{main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:03,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {3963#(= main_~x~0 0)} [133] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:03,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {3963#(= main_~x~0 0)} [134] L45-1-->L17-2_primed: Formula: (let ((.cse1 (< (mod v_main_~x~0_432 4294967296) 99)) (.cse0 (= (mod v_main_~y~0_49 2) 0))) (or (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_422 v_main_~x~0_432)) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20))) (forall ((v_it_18 Int)) (or (< (mod (+ v_main_~x~0_432 (* v_it_18 20)) 4294967296) 99) (not (<= 1 v_it_18)) (not (<= (+ v_it_18 1) (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20)))))) (= (mod (+ v_main_~x~0_432 (* v_main_~x~0_422 19)) 20) 0)) (and (= v_main_~x~0_432 v_main_~x~0_422) (= v_main_~y~0_49 v_main_~y~0_49)))) InVars {main_~x~0=v_main_~x~0_432, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_422, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[main_~x~0] {3964#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:58:03,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [129] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3965#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:58:03,241 INFO L272 TraceCheckUtils]: 12: Hoare triple {3965#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3966#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:58:03,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {3966#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3967#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:58:03,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {3967#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3959#false} is VALID [2022-04-28 02:58:03,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-04-28 02:58:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:58:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730043878] [2022-04-28 02:58:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730043878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480793866] [2022-04-28 02:58:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:03,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:03,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:03,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:03,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:58:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:58:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:06,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {3958#true} call ULTIMATE.init(); {3958#true} is VALID [2022-04-28 02:58:06,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3958#true} is VALID [2022-04-28 02:58:06,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-04-28 02:58:06,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3958#true} {3958#true} #96#return; {3958#true} is VALID [2022-04-28 02:58:06,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {3958#true} call #t~ret6 := main(); {3958#true} is VALID [2022-04-28 02:58:06,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3958#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:06,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3963#(= main_~x~0 0)} [130] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_49| |v_main_#t~post5_48|) (= v_main_~x~0_433 v_main_~x~0_400)) InVars {main_~x~0=v_main_~x~0_433, main_#t~post5=|v_main_#t~post5_49|} OutVars{main_~x~0=v_main_~x~0_400, main_#t~post5=|v_main_#t~post5_48|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:06,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(= main_~x~0 0)} [131] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:06,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {3963#(= main_~x~0 0)} [132] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_436 v_main_~x~0_411) InVars {main_~x~0=v_main_~x~0_436} OutVars{main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:06,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3963#(= main_~x~0 0)} [133] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3963#(= main_~x~0 0)} is VALID [2022-04-28 02:58:06,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {3963#(= main_~x~0 0)} [134] L45-1-->L17-2_primed: Formula: (let ((.cse1 (< (mod v_main_~x~0_432 4294967296) 99)) (.cse0 (= (mod v_main_~y~0_49 2) 0))) (or (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_422 v_main_~x~0_432)) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20))) (forall ((v_it_18 Int)) (or (< (mod (+ v_main_~x~0_432 (* v_it_18 20)) 4294967296) 99) (not (<= 1 v_it_18)) (not (<= (+ v_it_18 1) (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20)))))) (= (mod (+ v_main_~x~0_432 (* v_main_~x~0_422 19)) 20) 0)) (and (= v_main_~x~0_432 v_main_~x~0_422) (= v_main_~y~0_49 v_main_~y~0_49)))) InVars {main_~x~0=v_main_~x~0_432, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_422, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[main_~x~0] {4002#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (forall ((v_it_18 Int)) (or (not (<= 1 v_it_18)) (< (mod (* v_it_18 20) 4294967296) 99) (not (<= (+ v_it_18 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:58:06,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {4002#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (forall ((v_it_18 Int)) (or (not (<= 1 v_it_18)) (< (mod (* v_it_18 20) 4294967296) 99) (not (<= (+ v_it_18 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod main_~y~0 2) 0)))} [129] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4006#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (forall ((v_it_18 Int)) (or (not (<= 1 v_it_18)) (< (mod (* v_it_18 20) 4294967296) 99) (not (<= (+ v_it_18 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:58:06,379 INFO L272 TraceCheckUtils]: 12: Hoare triple {4006#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (forall ((v_it_18 Int)) (or (not (<= 1 v_it_18)) (< (mod (* v_it_18 20) 4294967296) 99) (not (<= (+ v_it_18 1) (div (* (- 1) main_~x~0) (- 20)))))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:06,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {4010#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:06,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3959#false} is VALID [2022-04-28 02:58:06,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-04-28 02:58:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:58:06,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:16,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {3959#false} assume !false; {3959#false} is VALID [2022-04-28 02:58:16,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3959#false} is VALID [2022-04-28 02:58:16,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {4010#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:16,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {3965#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:16,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {4033#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [129] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3965#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:58:17,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} [134] L45-1-->L17-2_primed: Formula: (let ((.cse1 (< (mod v_main_~x~0_432 4294967296) 99)) (.cse0 (= (mod v_main_~y~0_49 2) 0))) (or (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_422 v_main_~x~0_432)) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20))) (forall ((v_it_18 Int)) (or (< (mod (+ v_main_~x~0_432 (* v_it_18 20)) 4294967296) 99) (not (<= 1 v_it_18)) (not (<= (+ v_it_18 1) (div (+ v_main_~x~0_432 (* v_main_~x~0_422 (- 1))) (- 20)))))) (= (mod (+ v_main_~x~0_432 (* v_main_~x~0_422 19)) 20) 0)) (and (= v_main_~x~0_432 v_main_~x~0_422) (= v_main_~y~0_49 v_main_~y~0_49)))) InVars {main_~x~0=v_main_~x~0_432, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_422, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[main_~x~0] {4033#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:58:19,382 WARN L290 TraceCheckUtils]: 9: Hoare triple {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} [133] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} is UNKNOWN [2022-04-28 02:58:19,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} [132] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_436 v_main_~x~0_411) InVars {main_~x~0=v_main_~x~0_436} OutVars{main_~x~0=v_main_~x~0_411} AuxVars[] AssignedVars[main_~x~0] {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} is VALID [2022-04-28 02:58:21,395 WARN L290 TraceCheckUtils]: 7: Hoare triple {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} [131] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} is UNKNOWN [2022-04-28 02:58:21,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} [130] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_49| |v_main_#t~post5_48|) (= v_main_~x~0_433 v_main_~x~0_400)) InVars {main_~x~0=v_main_~x~0_433, main_#t~post5=|v_main_#t~post5_49|} OutVars{main_~x~0=v_main_~x~0_400, main_#t~post5=|v_main_#t~post5_48|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} is VALID [2022-04-28 02:58:21,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {3958#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4037#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 Int) (aux_div_v_main_~x~0_445_32 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 0) (exists ((v_it_18 Int)) (and (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 v_it_18 1) aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122) (<= 1 v_it_18) (not (< (mod (+ main_~x~0 (* v_it_18 20)) 4294967296) 99)))) (<= (+ (* 4294967296 aux_div_v_main_~x~0_445_32) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20) 4294967296) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 20) main_~x~0)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_445_32_80_122 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_445_32_80_122_58 20))))))} is VALID [2022-04-28 02:58:21,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {3958#true} call #t~ret6 := main(); {3958#true} is VALID [2022-04-28 02:58:21,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3958#true} {3958#true} #96#return; {3958#true} is VALID [2022-04-28 02:58:21,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {3958#true} assume true; {3958#true} is VALID [2022-04-28 02:58:21,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {3958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {3958#true} is VALID [2022-04-28 02:58:21,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {3958#true} call ULTIMATE.init(); {3958#true} is VALID [2022-04-28 02:58:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:58:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480793866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:21,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:58:22,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277518630] [2022-04-28 02:58:22,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277518630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:22,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:22,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 02:58:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989016005] [2022-04-28 02:58:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:22,173 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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 55 [2022-04-28 02:58:22,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:22,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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-28 02:58:22,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:22,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 02:58:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 02:58:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1511, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:58:22,210 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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-28 02:58:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:24,677 INFO L93 Difference]: Finished difference Result 92 states and 140 transitions. [2022-04-28 02:58:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 02:58:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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 55 [2022-04-28 02:58:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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-28 02:58:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2022-04-28 02:58:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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-28 02:58:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2022-04-28 02:58:24,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 119 transitions. [2022-04-28 02:58:24,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:24,786 INFO L225 Difference]: With dead ends: 92 [2022-04-28 02:58:24,786 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 02:58:24,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=479, Invalid=4633, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 02:58:24,787 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:24,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 02:58:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 02:58:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 02:58:24,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:24,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,841 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,842 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:24,842 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 02:58:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 02:58:24,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:24,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:24,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 02:58:24,843 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 02:58:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:24,844 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 02:58:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 02:58:24,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:24,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:24,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:24,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-04-28 02:58:24,845 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 55 [2022-04-28 02:58:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:24,845 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-04-28 02:58:24,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 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-28 02:58:24,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 85 transitions. [2022-04-28 02:58:24,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 02:58:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 02:58:24,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:24,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:24,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:25,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 02:58:25,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash -525598238, now seen corresponding path program 5 times [2022-04-28 02:58:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774888539] [2022-04-28 02:58:25,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:25,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:25,313 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1086231319, now seen corresponding path program 1 times [2022-04-28 02:58:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:25,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275360601] [2022-04-28 02:58:25,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:25,318 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_20.0) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_20.0)) 4294967296)) 99) 0)) [2022-04-28 02:58:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,328 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_20.1) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_20.1)) 4294967296)) 99) 0)) [2022-04-28 02:58:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {4612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {4602#true} is VALID [2022-04-28 02:58:25,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {4602#true} assume true; {4602#true} is VALID [2022-04-28 02:58:25,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4602#true} {4602#true} #96#return; {4602#true} is VALID [2022-04-28 02:58:25,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:25,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {4612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {4602#true} is VALID [2022-04-28 02:58:25,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {4602#true} assume true; {4602#true} is VALID [2022-04-28 02:58:25,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4602#true} {4602#true} #96#return; {4602#true} is VALID [2022-04-28 02:58:25,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {4602#true} call #t~ret6 := main(); {4602#true} is VALID [2022-04-28 02:58:25,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {4602#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:25,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {4607#(= main_~x~0 0)} [136] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_502 v_main_~x~0_480) (= |v_main_#t~post5_55| |v_main_#t~post5_54|)) InVars {main_~x~0=v_main_~x~0_502, main_#t~post5=|v_main_#t~post5_55|} OutVars{main_~x~0=v_main_~x~0_480, main_#t~post5=|v_main_#t~post5_54|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:25,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {4607#(= main_~x~0 0)} [137] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:25,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {4607#(= main_~x~0 0)} [138] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_53 2) 0)) (.cse1 (< (mod v_main_~x~0_501 4294967296) 99)) (.cse2 (= v_main_~x~0_501 v_main_~x~0_491))) (or (and (= (mod (+ v_main_~x~0_491 (* v_main_~x~0_501 19)) 20) 0) (< 0 (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)) .cse0 .cse1 (forall ((v_it_20 Int)) (or (< (mod (+ v_main_~x~0_501 (* v_it_20 20)) 4294967296) 99) (not (<= 1 v_it_20)) (not (<= (+ v_it_20 1) (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)))))) (and (or (not .cse0) (not .cse1)) .cse2) (and .cse2 (= v_main_~y~0_53 v_main_~y~0_53)))) InVars {main_~x~0=v_main_~x~0_501, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_491, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0] {4608#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:58:25,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {4608#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [135] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4609#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:58:25,431 INFO L272 TraceCheckUtils]: 10: Hoare triple {4609#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:58:25,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {4610#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4611#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:58:25,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {4611#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4603#false} is VALID [2022-04-28 02:58:25,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2022-04-28 02:58:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:58:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:25,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275360601] [2022-04-28 02:58:25,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275360601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:25,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11063564] [2022-04-28 02:58:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:25,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:25,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:25,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:58:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:58:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:30,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2022-04-28 02:58:30,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {4602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {4602#true} is VALID [2022-04-28 02:58:30,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {4602#true} assume true; {4602#true} is VALID [2022-04-28 02:58:30,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4602#true} {4602#true} #96#return; {4602#true} is VALID [2022-04-28 02:58:30,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {4602#true} call #t~ret6 := main(); {4602#true} is VALID [2022-04-28 02:58:30,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {4602#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:30,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {4607#(= main_~x~0 0)} [136] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_502 v_main_~x~0_480) (= |v_main_#t~post5_55| |v_main_#t~post5_54|)) InVars {main_~x~0=v_main_~x~0_502, main_#t~post5=|v_main_#t~post5_55|} OutVars{main_~x~0=v_main_~x~0_480, main_#t~post5=|v_main_#t~post5_54|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:30,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {4607#(= main_~x~0 0)} [137] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4607#(= main_~x~0 0)} is VALID [2022-04-28 02:58:30,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {4607#(= main_~x~0 0)} [138] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_53 2) 0)) (.cse1 (< (mod v_main_~x~0_501 4294967296) 99)) (.cse2 (= v_main_~x~0_501 v_main_~x~0_491))) (or (and (= (mod (+ v_main_~x~0_491 (* v_main_~x~0_501 19)) 20) 0) (< 0 (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)) .cse0 .cse1 (forall ((v_it_20 Int)) (or (< (mod (+ v_main_~x~0_501 (* v_it_20 20)) 4294967296) 99) (not (<= 1 v_it_20)) (not (<= (+ v_it_20 1) (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)))))) (and (or (not .cse0) (not .cse1)) .cse2) (and .cse2 (= v_main_~y~0_53 v_main_~y~0_53)))) InVars {main_~x~0=v_main_~x~0_501, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_491, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0] {4640#(or (= main_~x~0 0) (and (forall ((v_it_20 Int)) (or (not (<= (+ v_it_20 1) (div main_~x~0 20))) (not (<= 1 v_it_20)) (< (mod (* v_it_20 20) 4294967296) 99))) (< 0 (div main_~x~0 20)) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 20) 0)))} is VALID [2022-04-28 02:58:30,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {4640#(or (= main_~x~0 0) (and (forall ((v_it_20 Int)) (or (not (<= (+ v_it_20 1) (div main_~x~0 20))) (not (<= 1 v_it_20)) (< (mod (* v_it_20 20) 4294967296) 99))) (< 0 (div main_~x~0 20)) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 20) 0)))} [135] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4644#(and (forall ((v_it_20 Int)) (or (not (<= (+ v_it_20 1) (div main_~x~0 20))) (not (<= 1 v_it_20)) (< (mod (* v_it_20 20) 4294967296) 99))) (< 0 (div main_~x~0 20)) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 20) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:58:30,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {4644#(and (forall ((v_it_20 Int)) (or (not (<= (+ v_it_20 1) (div main_~x~0 20))) (not (<= 1 v_it_20)) (< (mod (* v_it_20 20) 4294967296) 99))) (< 0 (div main_~x~0 20)) (= (mod main_~y~0 2) 0) (= (mod main_~x~0 20) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:30,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:30,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {4652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4603#false} is VALID [2022-04-28 02:58:30,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2022-04-28 02:58:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:58:30,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:40,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2022-04-28 02:58:40,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {4652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4603#false} is VALID [2022-04-28 02:58:40,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:40,718 INFO L272 TraceCheckUtils]: 10: Hoare triple {4609#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:40,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {4671#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [135] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4609#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:58:42,735 WARN L290 TraceCheckUtils]: 8: Hoare triple {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} [138] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_53 2) 0)) (.cse1 (< (mod v_main_~x~0_501 4294967296) 99)) (.cse2 (= v_main_~x~0_501 v_main_~x~0_491))) (or (and (= (mod (+ v_main_~x~0_491 (* v_main_~x~0_501 19)) 20) 0) (< 0 (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)) .cse0 .cse1 (forall ((v_it_20 Int)) (or (< (mod (+ v_main_~x~0_501 (* v_it_20 20)) 4294967296) 99) (not (<= 1 v_it_20)) (not (<= (+ v_it_20 1) (div (+ v_main_~x~0_491 (* v_main_~x~0_501 (- 1))) 20)))))) (and (or (not .cse0) (not .cse1)) .cse2) (and .cse2 (= v_main_~y~0_53 v_main_~y~0_53)))) InVars {main_~x~0=v_main_~x~0_501, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_491, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0] {4671#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is UNKNOWN [2022-04-28 02:58:42,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} [137] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} is VALID [2022-04-28 02:58:42,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} [136] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_502 v_main_~x~0_480) (= |v_main_#t~post5_55| |v_main_#t~post5_54|)) InVars {main_~x~0=v_main_~x~0_502, main_#t~post5=|v_main_#t~post5_55|} OutVars{main_~x~0=v_main_~x~0_480, main_#t~post5=|v_main_#t~post5_54|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} is VALID [2022-04-28 02:58:42,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {4602#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4675#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* 19 main_~x~0) (- 2)) (+ (div (+ (- 2) (* main_~x~0 (- 19))) 2) 1)) (forall ((aux_div_v_main_~x~0_510_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 Int)) (or (<= (+ (* 4294967296 aux_div_v_main_~x~0_510_32) 4294967296 (* 19 main_~x~0)) (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 main_~x~0) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111 20) (+ (* 4294967296 aux_div_v_main_~x~0_510_32) (* 19 main_~x~0) 99)) (exists ((v_it_20 Int)) (and (<= (+ main_~x~0 v_it_20 1) aux_div_aux_mod_aux_mod_v_main_~x~0_510_32_80_111) (not (< (mod (+ main_~x~0 (* v_it_20 20)) 4294967296) 99)) (<= 1 v_it_20)))))))} is VALID [2022-04-28 02:58:42,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {4602#true} call #t~ret6 := main(); {4602#true} is VALID [2022-04-28 02:58:42,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4602#true} {4602#true} #96#return; {4602#true} is VALID [2022-04-28 02:58:42,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {4602#true} assume true; {4602#true} is VALID [2022-04-28 02:58:42,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {4602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {4602#true} is VALID [2022-04-28 02:58:42,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2022-04-28 02:58:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:58:42,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11063564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:42,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:42,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:58:43,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774888539] [2022-04-28 02:58:43,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774888539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:43,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:43,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 02:58:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865979704] [2022-04-28 02:58:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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 55 [2022-04-28 02:58:43,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:43,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-28 02:58:43,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 02:58:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 02:58:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1668, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 02:58:43,745 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-28 02:58:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:46,972 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-04-28 02:58:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 02:58:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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 55 [2022-04-28 02:58:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-28 02:58:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 116 transitions. [2022-04-28 02:58:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-28 02:58:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 116 transitions. [2022-04-28 02:58:46,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 116 transitions. [2022-04-28 02:58:47,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:47,092 INFO L225 Difference]: With dead ends: 95 [2022-04-28 02:58:47,092 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 02:58:47,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=511, Invalid=5189, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:58:47,094 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:47,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 158 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 02:58:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 02:58:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 02:58:47,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:47,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:47,148 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:47,148 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:47,149 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-04-28 02:58:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-04-28 02:58:47,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:47,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:47,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:58:47,150 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:58:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:47,150 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-04-28 02:58:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-04-28 02:58:47,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:47,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:47,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:47,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-04-28 02:58:47,152 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 55 [2022-04-28 02:58:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:47,152 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-04-28 02:58:47,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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-28 02:58:47,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 88 transitions. [2022-04-28 02:58:47,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-04-28 02:58:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:58:47,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:47,263 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:47,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:47,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 02:58:47,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1860186853, now seen corresponding path program 6 times [2022-04-28 02:58:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260356380] [2022-04-28 02:58:47,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:47,497 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:47,661 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:47,662 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -830327402, now seen corresponding path program 1 times [2022-04-28 02:58:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:47,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274751971] [2022-04-28 02:58:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:47,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_23.0) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_23.0)) 4294967296)) 99) 0)) [2022-04-28 02:58:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:47,678 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_23.1) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_23.1)) 4294967296)) 99) 0)) [2022-04-28 02:58:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:47,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {5268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5258#true} {5258#true} #96#return; {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:47,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {5268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #96#return; {5258#true} is VALID [2022-04-28 02:58:47,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret6 := main(); {5258#true} is VALID [2022-04-28 02:58:47,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:47,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= main_~x~0 0)} [140] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_61| |v_main_#t~post5_60|) (= v_main_~x~0_579 v_main_~x~0_546)) InVars {main_~x~0=v_main_~x~0_579, main_#t~post5=|v_main_#t~post5_61|} OutVars{main_~x~0=v_main_~x~0_546, main_#t~post5=|v_main_#t~post5_60|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:47,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {5263#(= main_~x~0 0)} [141] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:47,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {5263#(= main_~x~0 0)} [142] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_582 v_main_~x~0_557) InVars {main_~x~0=v_main_~x~0_582} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[main_~x~0] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:47,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {5263#(= main_~x~0 0)} [143] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:47,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {5263#(= main_~x~0 0)} [144] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_578 v_main_~x~0_568)) (.cse2 (< (mod v_main_~x~0_578 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_58 2) 0))) (or (and (= v_main_~y~0_58 v_main_~y~0_58) .cse0) (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 (< 0 (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_578 (* v_main_~x~0_568 19)) 20) 0) .cse1 (forall ((v_it_23 Int)) (or (< (mod (+ v_main_~x~0_578 (* v_it_23 20)) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))))))))) InVars {main_~x~0=v_main_~x~0_578, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_568, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[main_~x~0] {5264#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:58:47,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {5264#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [139] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5265#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:58:47,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {5265#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:58:47,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {5266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:58:47,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {5267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 02:58:47,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 02:58:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:58:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274751971] [2022-04-28 02:58:47,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274751971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633124239] [2022-04-28 02:58:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:47,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:47,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:47,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:58:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:47,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:58:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:47,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:50,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-28 02:58:50,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 02:58:50,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 02:58:50,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #96#return; {5258#true} is VALID [2022-04-28 02:58:50,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret6 := main(); {5258#true} is VALID [2022-04-28 02:58:50,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:50,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= main_~x~0 0)} [140] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_61| |v_main_#t~post5_60|) (= v_main_~x~0_579 v_main_~x~0_546)) InVars {main_~x~0=v_main_~x~0_579, main_#t~post5=|v_main_#t~post5_61|} OutVars{main_~x~0=v_main_~x~0_546, main_#t~post5=|v_main_#t~post5_60|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:50,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {5263#(= main_~x~0 0)} [141] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:50,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {5263#(= main_~x~0 0)} [142] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_582 v_main_~x~0_557) InVars {main_~x~0=v_main_~x~0_582} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[main_~x~0] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:50,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {5263#(= main_~x~0 0)} [143] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5263#(= main_~x~0 0)} is VALID [2022-04-28 02:58:50,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {5263#(= main_~x~0 0)} [144] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_578 v_main_~x~0_568)) (.cse2 (< (mod v_main_~x~0_578 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_58 2) 0))) (or (and (= v_main_~y~0_58 v_main_~y~0_58) .cse0) (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 (< 0 (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_578 (* v_main_~x~0_568 19)) 20) 0) .cse1 (forall ((v_it_23 Int)) (or (< (mod (+ v_main_~x~0_578 (* v_it_23 20)) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))))))))) InVars {main_~x~0=v_main_~x~0_578, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_568, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[main_~x~0] {5302#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_23 Int)) (or (< (mod (* v_it_23 20) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (* (- 1) main_~x~0) (- 20))))))))} is VALID [2022-04-28 02:58:50,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {5302#(or (= main_~x~0 0) (and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (forall ((v_it_23 Int)) (or (< (mod (* v_it_23 20) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (* (- 1) main_~x~0) (- 20))))))))} [139] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5306#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)) (forall ((v_it_23 Int)) (or (< (mod (* v_it_23 20) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (* (- 1) main_~x~0) (- 20)))))))} is VALID [2022-04-28 02:58:50,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {5306#(and (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)) (forall ((v_it_23 Int)) (or (< (mod (* v_it_23 20) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (* (- 1) main_~x~0) (- 20)))))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5310#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:50,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {5310#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5314#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:50,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {5314#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 02:58:50,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 02:58:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:58:50,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:00,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 02:59:00,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {5314#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 02:59:00,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {5310#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5314#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:00,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {5265#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5310#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:00,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {5333#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [139] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5265#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:59:02,306 WARN L290 TraceCheckUtils]: 10: Hoare triple {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [144] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_578 v_main_~x~0_568)) (.cse2 (< (mod v_main_~x~0_578 4294967296) 99)) (.cse1 (= (mod v_main_~y~0_58 2) 0))) (or (and (= v_main_~y~0_58 v_main_~y~0_58) .cse0) (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 (< 0 (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_578 (* v_main_~x~0_568 19)) 20) 0) .cse1 (forall ((v_it_23 Int)) (or (< (mod (+ v_main_~x~0_578 (* v_it_23 20)) 4294967296) 99) (not (<= 1 v_it_23)) (not (<= (+ v_it_23 1) (div (+ v_main_~x~0_578 (* v_main_~x~0_568 (- 1))) (- 20))))))))) InVars {main_~x~0=v_main_~x~0_578, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_568, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[main_~x~0] {5333#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is UNKNOWN [2022-04-28 02:59:02,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [143] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 02:59:02,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [142] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_582 v_main_~x~0_557) InVars {main_~x~0=v_main_~x~0_582} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[main_~x~0] {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 02:59:02,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [141] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 02:59:02,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [140] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_61| |v_main_#t~post5_60|) (= v_main_~x~0_579 v_main_~x~0_546)) InVars {main_~x~0=v_main_~x~0_579, main_#t~post5=|v_main_#t~post5_61|} OutVars{main_~x~0=v_main_~x~0_546, main_#t~post5=|v_main_#t~post5_60|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 02:59:02,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5337#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 Int) (aux_div_v_main_~x~0_591_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122 0) (< (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_591_32) 99)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 0) (exists ((v_it_23 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_23 20)) 4294967296) 99)) (<= 1 v_it_23) (<= (+ v_it_23 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_591_32_80_122_58 20) 4294967296 (* 4294967296 aux_div_v_main_~x~0_591_32)) (+ main_~x~0 (* 20 aux_div_aux_mod_aux_mod_v_main_~x~0_591_32_80_122)))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 02:59:02,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret6 := main(); {5258#true} is VALID [2022-04-28 02:59:02,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #96#return; {5258#true} is VALID [2022-04-28 02:59:02,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 02:59:02,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 02:59:02,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-28 02:59:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:59:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633124239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:02,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:59:03,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:03,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260356380] [2022-04-28 02:59:03,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260356380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:03,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:03,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 02:59:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415038942] [2022-04-28 02:59:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:03,678 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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 66 [2022-04-28 02:59:03,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:03,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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-28 02:59:03,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 02:59:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 02:59:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2380, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:59:03,725 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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-28 02:59:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,545 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2022-04-28 02:59:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 02:59:08,545 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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 66 [2022-04-28 02:59:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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-28 02:59:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 130 transitions. [2022-04-28 02:59:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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-28 02:59:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 130 transitions. [2022-04-28 02:59:08,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 130 transitions. [2022-04-28 02:59:08,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:08,685 INFO L225 Difference]: With dead ends: 103 [2022-04-28 02:59:08,685 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 02:59:08,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=631, Invalid=7741, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 02:59:08,687 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:08,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 191 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 02:59:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 02:59:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 02:59:08,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:08,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,754 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,754 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,755 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 02:59:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 02:59:08,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:08,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:08,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:59:08,755 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:59:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,756 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 02:59:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 02:59:08,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:08,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:08,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:08,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2022-04-28 02:59:08,758 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 66 [2022-04-28 02:59:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:08,758 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2022-04-28 02:59:08,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 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-28 02:59:08,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 96 transitions. [2022-04-28 02:59:08,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 02:59:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:59:08,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:08,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:08,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:09,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:09,079 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 133957853, now seen corresponding path program 7 times [2022-04-28 02:59:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:09,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738063871] [2022-04-28 02:59:09,102 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:09,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:09,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1915094423, now seen corresponding path program 1 times [2022-04-28 02:59:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:09,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153308580] [2022-04-28 02:59:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:09,783 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_25.0) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_25.0)) 4294967296)) 99) 0)) [2022-04-28 02:59:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,795 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_25.1) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_25.1)) 4294967296)) 99) 0)) [2022-04-28 02:59:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {6008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5998#true} is VALID [2022-04-28 02:59:09,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {5998#true} assume true; {5998#true} is VALID [2022-04-28 02:59:09,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5998#true} {5998#true} #96#return; {5998#true} is VALID [2022-04-28 02:59:09,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {5998#true} call ULTIMATE.init(); {6008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:09,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {6008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5998#true} is VALID [2022-04-28 02:59:09,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {5998#true} assume true; {5998#true} is VALID [2022-04-28 02:59:09,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5998#true} {5998#true} #96#return; {5998#true} is VALID [2022-04-28 02:59:09,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {5998#true} call #t~ret6 := main(); {5998#true} is VALID [2022-04-28 02:59:09,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {5998#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:09,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {6003#(= main_~x~0 0)} [146] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_658 v_main_~x~0_636) (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) InVars {main_~x~0=v_main_~x~0_658, main_#t~post5=|v_main_#t~post5_67|} OutVars{main_~x~0=v_main_~x~0_636, main_#t~post5=|v_main_#t~post5_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:09,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {6003#(= main_~x~0 0)} [147] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:09,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {6003#(= main_~x~0 0)} [148] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_657 v_main_~x~0_647)) (.cse1 (= (mod v_main_~y~0_62 2) 0)) (.cse2 (< (mod v_main_~x~0_657 4294967296) 99))) (or (and .cse0 (= v_main_~y~0_62 v_main_~y~0_62)) (and .cse1 (= (mod (+ v_main_~x~0_657 (* v_main_~x~0_647 19)) 20) 0) .cse2 (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_657 (* v_it_25 20)) 4294967296) 99) (not (<= 1 v_it_25)))) (< 0 (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (and .cse0 (or (not .cse1) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_657, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_647, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[main_~x~0] {6004#(or (= main_~x~0 0) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} is VALID [2022-04-28 02:59:09,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {6004#(or (= main_~x~0 0) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} [145] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6005#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (not (= main_~x~0 0)))} is VALID [2022-04-28 02:59:09,916 INFO L272 TraceCheckUtils]: 10: Hoare triple {6005#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))) (not (= main_~x~0 0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:59:09,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {6006#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6007#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:59:09,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {6007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5999#false} is VALID [2022-04-28 02:59:09,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {5999#false} assume !false; {5999#false} is VALID [2022-04-28 02:59:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:09,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153308580] [2022-04-28 02:59:09,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153308580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:09,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128268235] [2022-04-28 02:59:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:09,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:09,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:59:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:59:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:10,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {5998#true} call ULTIMATE.init(); {5998#true} is VALID [2022-04-28 02:59:10,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {5998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5998#true} is VALID [2022-04-28 02:59:10,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {5998#true} assume true; {5998#true} is VALID [2022-04-28 02:59:10,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5998#true} {5998#true} #96#return; {5998#true} is VALID [2022-04-28 02:59:10,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {5998#true} call #t~ret6 := main(); {5998#true} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {5998#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {6003#(= main_~x~0 0)} [146] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_658 v_main_~x~0_636) (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) InVars {main_~x~0=v_main_~x~0_658, main_#t~post5=|v_main_#t~post5_67|} OutVars{main_~x~0=v_main_~x~0_636, main_#t~post5=|v_main_#t~post5_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {6003#(= main_~x~0 0)} [147] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6003#(= main_~x~0 0)} is VALID [2022-04-28 02:59:10,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {6003#(= main_~x~0 0)} [148] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_657 v_main_~x~0_647)) (.cse1 (= (mod v_main_~y~0_62 2) 0)) (.cse2 (< (mod v_main_~x~0_657 4294967296) 99))) (or (and .cse0 (= v_main_~y~0_62 v_main_~y~0_62)) (and .cse1 (= (mod (+ v_main_~x~0_657 (* v_main_~x~0_647 19)) 20) 0) .cse2 (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_657 (* v_it_25 20)) 4294967296) 99) (not (<= 1 v_it_25)))) (< 0 (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (and .cse0 (or (not .cse1) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_657, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_647, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[main_~x~0] {6036#(or (= main_~x~0 0) (and (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_25)) (< (mod (* v_it_25 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:59:10,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {6036#(or (= main_~x~0 0) (and (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_25)) (< (mod (* v_it_25 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} [145] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6040#(and (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_25)) (< (mod (* v_it_25 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:59:10,742 INFO L272 TraceCheckUtils]: 10: Hoare triple {6040#(and (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_25)) (< (mod (* v_it_25 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:10,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:10,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {6048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5999#false} is VALID [2022-04-28 02:59:10,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {5999#false} assume !false; {5999#false} is VALID [2022-04-28 02:59:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:10,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:20,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {5999#false} assume !false; {5999#false} is VALID [2022-04-28 02:59:20,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {6048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5999#false} is VALID [2022-04-28 02:59:20,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:20,734 INFO L272 TraceCheckUtils]: 10: Hoare triple {6064#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:20,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {6068#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} [145] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6064#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 02:59:22,742 WARN L290 TraceCheckUtils]: 8: Hoare triple {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} [148] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_657 v_main_~x~0_647)) (.cse1 (= (mod v_main_~y~0_62 2) 0)) (.cse2 (< (mod v_main_~x~0_657 4294967296) 99))) (or (and .cse0 (= v_main_~y~0_62 v_main_~y~0_62)) (and .cse1 (= (mod (+ v_main_~x~0_657 (* v_main_~x~0_647 19)) 20) 0) .cse2 (forall ((v_it_25 Int)) (or (not (<= (+ v_it_25 1) (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_657 (* v_it_25 20)) 4294967296) 99) (not (<= 1 v_it_25)))) (< 0 (div (+ v_main_~x~0_657 (* v_main_~x~0_647 (- 1))) (- 20)))) (and .cse0 (or (not .cse1) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_657, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_647, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[main_~x~0] {6068#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is UNKNOWN [2022-04-28 02:59:22,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} [147] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} is VALID [2022-04-28 02:59:22,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} [146] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_658 v_main_~x~0_636) (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) InVars {main_~x~0=v_main_~x~0_658, main_#t~post5=|v_main_#t~post5_67|} OutVars{main_~x~0=v_main_~x~0_636, main_#t~post5=|v_main_#t~post5_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} is VALID [2022-04-28 02:59:22,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {5998#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6072#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 Int) (aux_div_v_main_~x~0_666_32 Int)) (or (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) (* 4294967296 aux_div_v_main_~x~0_666_32) 99)) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168 0) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20) 0) (exists ((v_it_25 Int)) (and (<= (+ v_it_25 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 1) aux_div_aux_mod_aux_mod_v_main_~x~0_666_32_34_168) (not (< (mod (+ (* v_it_25 20) main_~x~0) 4294967296) 99)) (<= 1 v_it_25))) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_666_32_34_168_58 20))))))} is VALID [2022-04-28 02:59:22,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {5998#true} call #t~ret6 := main(); {5998#true} is VALID [2022-04-28 02:59:22,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5998#true} {5998#true} #96#return; {5998#true} is VALID [2022-04-28 02:59:22,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {5998#true} assume true; {5998#true} is VALID [2022-04-28 02:59:22,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {5998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {5998#true} is VALID [2022-04-28 02:59:22,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {5998#true} call ULTIMATE.init(); {5998#true} is VALID [2022-04-28 02:59:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:22,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128268235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:22,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:22,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-28 02:59:24,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:24,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [738063871] [2022-04-28 02:59:24,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [738063871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:24,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:24,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 02:59:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453330346] [2022-04-28 02:59:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:24,200 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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 66 [2022-04-28 02:59:24,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:24,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-28 02:59:24,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:24,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 02:59:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:24,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 02:59:24,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2639, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 02:59:24,251 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-28 02:59:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:29,323 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2022-04-28 02:59:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 02:59:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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 66 [2022-04-28 02:59:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-28 02:59:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 127 transitions. [2022-04-28 02:59:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-28 02:59:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 127 transitions. [2022-04-28 02:59:29,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 127 transitions. [2022-04-28 02:59:29,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:29,431 INFO L225 Difference]: With dead ends: 117 [2022-04-28 02:59:29,431 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 02:59:29,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=750, Invalid=8562, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 02:59:29,433 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:29,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 02:59:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 02:59:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2022-04-28 02:59:29,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:29,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:29,521 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:29,521 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:29,522 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-04-28 02:59:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2022-04-28 02:59:29,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:29,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:29,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:59:29,522 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:59:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:29,523 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-04-28 02:59:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2022-04-28 02:59:29,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:29,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:29,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:29,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2022-04-28 02:59:29,525 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 66 [2022-04-28 02:59:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:29,525 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2022-04-28 02:59:29,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-28 02:59:29,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 99 transitions. [2022-04-28 02:59:29,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-04-28 02:59:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 02:59:29,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:29,652 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:29,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:29,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 02:59:29,866 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1826433856, now seen corresponding path program 8 times [2022-04-28 02:59:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:29,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897577069] [2022-04-28 02:59:29,893 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:29,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:30,071 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:30,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1433692502, now seen corresponding path program 1 times [2022-04-28 02:59:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:30,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93632026] [2022-04-28 02:59:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:30,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_28.0) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_28.0)) 4294967296)) 99) 0)) [2022-04-28 02:59:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:30,091 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_8) (* (- 20) .v_it_28.1) (* 4294967296 (div (+ main_~x~0_8 (* 20 .v_it_28.1)) 4294967296)) 99) 0)) [2022-04-28 02:59:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:30,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {6805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {6795#true} is VALID [2022-04-28 02:59:30,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {6795#true} assume true; {6795#true} is VALID [2022-04-28 02:59:30,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6795#true} {6795#true} #96#return; {6795#true} is VALID [2022-04-28 02:59:30,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {6795#true} call ULTIMATE.init(); {6805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:30,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {6805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {6795#true} is VALID [2022-04-28 02:59:30,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {6795#true} assume true; {6795#true} is VALID [2022-04-28 02:59:30,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6795#true} {6795#true} #96#return; {6795#true} is VALID [2022-04-28 02:59:30,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {6795#true} call #t~ret6 := main(); {6795#true} is VALID [2022-04-28 02:59:30,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {6795#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:30,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {6800#(= main_~x~0 0)} [150] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_73| |v_main_#t~post5_72|) (= v_main_~x~0_745 v_main_~x~0_712)) InVars {main_~x~0=v_main_~x~0_745, main_#t~post5=|v_main_#t~post5_73|} OutVars{main_~x~0=v_main_~x~0_712, main_#t~post5=|v_main_#t~post5_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:30,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {6800#(= main_~x~0 0)} [151] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:30,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {6800#(= main_~x~0 0)} [152] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_748 v_main_~x~0_723) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_723} AuxVars[] AssignedVars[main_~x~0] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:30,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {6800#(= main_~x~0 0)} [153] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:30,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {6800#(= main_~x~0 0)} [154] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_67 2) 0)) (.cse1 (< (mod v_main_~x~0_744 4294967296) 99))) (or (and (< 0 (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20))) .cse0 (= (mod (+ v_main_~x~0_744 (* v_main_~x~0_734 19)) 20) 0) (forall ((v_it_28 Int)) (or (< (mod (+ v_main_~x~0_744 (* v_it_28 20)) 4294967296) 99) (not (<= 1 v_it_28)) (not (<= (+ v_it_28 1) (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20)))))) .cse1) (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_734 v_main_~x~0_744)) (and (= v_main_~x~0_744 v_main_~x~0_734) (= v_main_~y~0_67 v_main_~y~0_67)))) InVars {main_~x~0=v_main_~x~0_744, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_734, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[main_~x~0] {6801#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} is VALID [2022-04-28 02:59:30,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {6801#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} [149] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6802#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} is VALID [2022-04-28 02:59:30,998 INFO L272 TraceCheckUtils]: 12: Hoare triple {6802#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6803#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:59:30,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {6803#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6804#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:59:30,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {6804#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6796#false} is VALID [2022-04-28 02:59:30,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {6796#false} assume !false; {6796#false} is VALID [2022-04-28 02:59:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:59:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:30,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93632026] [2022-04-28 02:59:30,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93632026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:30,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177288096] [2022-04-28 02:59:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:30,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:30,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:31,000 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:31,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:59:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:31,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:59:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:31,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:33,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {6795#true} call ULTIMATE.init(); {6795#true} is VALID [2022-04-28 02:59:33,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {6795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {6795#true} is VALID [2022-04-28 02:59:33,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {6795#true} assume true; {6795#true} is VALID [2022-04-28 02:59:33,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6795#true} {6795#true} #96#return; {6795#true} is VALID [2022-04-28 02:59:33,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {6795#true} call #t~ret6 := main(); {6795#true} is VALID [2022-04-28 02:59:33,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {6795#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:33,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {6800#(= main_~x~0 0)} [150] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_73| |v_main_#t~post5_72|) (= v_main_~x~0_745 v_main_~x~0_712)) InVars {main_~x~0=v_main_~x~0_745, main_#t~post5=|v_main_#t~post5_73|} OutVars{main_~x~0=v_main_~x~0_712, main_#t~post5=|v_main_#t~post5_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:33,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {6800#(= main_~x~0 0)} [151] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:33,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {6800#(= main_~x~0 0)} [152] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_748 v_main_~x~0_723) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_723} AuxVars[] AssignedVars[main_~x~0] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:33,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {6800#(= main_~x~0 0)} [153] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6800#(= main_~x~0 0)} is VALID [2022-04-28 02:59:33,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {6800#(= main_~x~0 0)} [154] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_67 2) 0)) (.cse1 (< (mod v_main_~x~0_744 4294967296) 99))) (or (and (< 0 (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20))) .cse0 (= (mod (+ v_main_~x~0_744 (* v_main_~x~0_734 19)) 20) 0) (forall ((v_it_28 Int)) (or (< (mod (+ v_main_~x~0_744 (* v_it_28 20)) 4294967296) 99) (not (<= 1 v_it_28)) (not (<= (+ v_it_28 1) (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20)))))) .cse1) (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_734 v_main_~x~0_744)) (and (= v_main_~x~0_744 v_main_~x~0_734) (= v_main_~y~0_67 v_main_~y~0_67)))) InVars {main_~x~0=v_main_~x~0_744, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_734, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[main_~x~0] {6839#(or (= main_~x~0 0) (and (forall ((v_it_28 Int)) (or (not (<= (+ v_it_28 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_28 20) 4294967296) 99) (not (<= 1 v_it_28)))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:59:33,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {6839#(or (= main_~x~0 0) (and (forall ((v_it_28 Int)) (or (not (<= (+ v_it_28 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_28 20) 4294967296) 99) (not (<= 1 v_it_28)))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} [149] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6843#(and (forall ((v_it_28 Int)) (or (not (<= (+ v_it_28 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_28 20) 4294967296) 99) (not (<= 1 v_it_28)))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:59:33,464 INFO L272 TraceCheckUtils]: 12: Hoare triple {6843#(and (forall ((v_it_28 Int)) (or (not (<= (+ v_it_28 1) (div (* (- 1) main_~x~0) (- 20)))) (< (mod (* v_it_28 20) 4294967296) 99) (not (<= 1 v_it_28)))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:33,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {6847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:33,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {6851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6796#false} is VALID [2022-04-28 02:59:33,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {6796#false} assume !false; {6796#false} is VALID [2022-04-28 02:59:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:59:33,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:42,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {6796#false} assume !false; {6796#false} is VALID [2022-04-28 02:59:42,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {6851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6796#false} is VALID [2022-04-28 02:59:42,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {6847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:42,499 INFO L272 TraceCheckUtils]: 12: Hoare triple {6802#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:42,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {6870#(or (< (mod main_~x~0 4294967296) 99) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} [149] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6802#(and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2))))} is VALID [2022-04-28 02:59:44,505 WARN L290 TraceCheckUtils]: 10: Hoare triple {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} [154] L45-1-->L17-2_primed: Formula: (let ((.cse0 (= (mod v_main_~y~0_67 2) 0)) (.cse1 (< (mod v_main_~x~0_744 4294967296) 99))) (or (and (< 0 (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20))) .cse0 (= (mod (+ v_main_~x~0_744 (* v_main_~x~0_734 19)) 20) 0) (forall ((v_it_28 Int)) (or (< (mod (+ v_main_~x~0_744 (* v_it_28 20)) 4294967296) 99) (not (<= 1 v_it_28)) (not (<= (+ v_it_28 1) (div (+ (* v_main_~x~0_734 (- 1)) v_main_~x~0_744) (- 20)))))) .cse1) (and (or (not .cse0) (not .cse1)) (= v_main_~x~0_734 v_main_~x~0_744)) (and (= v_main_~x~0_744 v_main_~x~0_734) (= v_main_~y~0_67 v_main_~y~0_67)))) InVars {main_~x~0=v_main_~x~0_744, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_734, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[main_~x~0] {6870#(or (< (mod main_~x~0 4294967296) 99) (and (< (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0 1)) (<= (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2)))))} is UNKNOWN [2022-04-28 02:59:44,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} [153] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} is VALID [2022-04-28 02:59:44,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} [152] L45-1-->L17-2_primed: Formula: (= v_main_~x~0_748 v_main_~x~0_723) InVars {main_~x~0=v_main_~x~0_748} OutVars{main_~x~0=v_main_~x~0_723} AuxVars[] AssignedVars[main_~x~0] {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} is VALID [2022-04-28 02:59:44,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} [151] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} is VALID [2022-04-28 02:59:44,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} [150] L45-1-->L17-2_primed: Formula: (and (= |v_main_#t~post5_73| |v_main_#t~post5_72|) (= v_main_~x~0_745 v_main_~x~0_712)) InVars {main_~x~0=v_main_~x~0_745, main_#t~post5=|v_main_#t~post5_73|} OutVars{main_~x~0=v_main_~x~0_712, main_#t~post5=|v_main_#t~post5_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} is VALID [2022-04-28 02:59:44,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {6795#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6874#(and (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 Int) (aux_div_v_main_~x~0_757_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 Int)) (or (<= aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 0) (exists ((v_it_28 Int)) (and (not (< (mod (+ main_~x~0 (* v_it_28 20)) 4294967296) 99)) (<= 1 v_it_28) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 v_it_28 1) aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 4294967296) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) 0) (<= 20 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20)) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_757_32_80_122 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_757_32_80_122_58 20) (* 4294967296 aux_div_v_main_~x~0_757_32) 99))))))} is VALID [2022-04-28 02:59:44,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {6795#true} call #t~ret6 := main(); {6795#true} is VALID [2022-04-28 02:59:44,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6795#true} {6795#true} #96#return; {6795#true} is VALID [2022-04-28 02:59:44,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {6795#true} assume true; {6795#true} is VALID [2022-04-28 02:59:44,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {6795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {6795#true} is VALID [2022-04-28 02:59:44,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {6795#true} call ULTIMATE.init(); {6795#true} is VALID [2022-04-28 02:59:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:59:44,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177288096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:44,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:44,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:59:46,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897577069] [2022-04-28 02:59:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897577069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:46,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:46,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 02:59:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439853373] [2022-04-28 02:59:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:46,211 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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 77 [2022-04-28 02:59:46,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:46,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-28 02:59:46,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:46,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 02:59:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 02:59:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 02:59:46,265 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-28 02:59:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:52,796 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2022-04-28 02:59:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 02:59:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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 77 [2022-04-28 02:59:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-28 02:59:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 141 transitions. [2022-04-28 02:59:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-28 02:59:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 141 transitions. [2022-04-28 02:59:52,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 141 transitions. [2022-04-28 02:59:52,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:52,920 INFO L225 Difference]: With dead ends: 114 [2022-04-28 02:59:52,920 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 02:59:52,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2196 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=783, Invalid=11649, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 02:59:52,923 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 3744 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 3874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:52,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 196 Invalid, 3874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3744 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 02:59:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 02:59:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 02:59:53,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:53,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:53,012 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:53,012 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:53,013 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-28 02:59:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-28 02:59:53,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:53,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:53,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 02:59:53,014 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 02:59:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:53,015 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-04-28 02:59:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-28 02:59:53,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:53,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:53,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:53,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-04-28 02:59:53,016 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 77 [2022-04-28 02:59:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:53,016 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-04-28 02:59:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 53 states have internal predecessors, (72), 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-28 02:59:53,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 107 transitions. [2022-04-28 02:59:53,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-04-28 02:59:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 02:59:53,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:53,163 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:53,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:53,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 02:59:53,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash -474388734, now seen corresponding path program 9 times [2022-04-28 02:59:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:53,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30305925] [2022-04-28 02:59:53,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:53,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:53,608 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1551009769, now seen corresponding path program 1 times [2022-04-28 02:59:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:53,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639454674] [2022-04-28 02:59:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:53,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_30.0) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_30.0)) 4294967296)) 99) 0)) [2022-04-28 02:59:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:53,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 20) .v_it_30.1) (* 4294967296 (div (+ main_~x~0_6 (* 20 .v_it_30.1)) 4294967296)) 99) 0)) [2022-04-28 02:59:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:53,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {7641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {7631#true} is VALID [2022-04-28 02:59:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7631#true} assume true; {7631#true} is VALID [2022-04-28 02:59:53,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7631#true} {7631#true} #96#return; {7631#true} is VALID [2022-04-28 02:59:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {7631#true} call ULTIMATE.init(); {7641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {7631#true} is VALID [2022-04-28 02:59:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {7631#true} assume true; {7631#true} is VALID [2022-04-28 02:59:53,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7631#true} {7631#true} #96#return; {7631#true} is VALID [2022-04-28 02:59:53,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {7631#true} call #t~ret6 := main(); {7631#true} is VALID [2022-04-28 02:59:53,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {7631#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:53,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {7636#(= main_~x~0 0)} [156] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_834 v_main_~x~0_812) (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) InVars {main_~x~0=v_main_~x~0_834, main_#t~post5=|v_main_#t~post5_79|} OutVars{main_~x~0=v_main_~x~0_812, main_#t~post5=|v_main_#t~post5_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:53,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {7636#(= main_~x~0 0)} [157] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:53,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(= main_~x~0 0)} [158] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_71 2) 0)) (.cse2 (< (mod v_main_~x~0_833 4294967296) 99)) (.cse0 (= v_main_~x~0_833 v_main_~x~0_823))) (or (and (= v_main_~y~0_71 v_main_~y~0_71) .cse0) (and (< 0 (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_833 (* v_main_~x~0_823 19)) 20) 0) .cse1 .cse2 (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_833 (* v_it_30 20)) 4294967296) 99) (not (<= 1 v_it_30))))) (and (or (not .cse1) (not .cse2)) .cse0))) InVars {main_~x~0=v_main_~x~0_833, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_823, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[main_~x~0] {7637#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is VALID [2022-04-28 02:59:53,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#(or (= main_~x~0 0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [155] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7638#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 02:59:53,719 INFO L272 TraceCheckUtils]: 10: Hoare triple {7638#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:59:53,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {7639#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7640#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:59:53,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {7640#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7632#false} is VALID [2022-04-28 02:59:53,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {7632#false} assume !false; {7632#false} is VALID [2022-04-28 02:59:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639454674] [2022-04-28 02:59:53,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639454674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897068619] [2022-04-28 02:59:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:53,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:53,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 02:59:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:53,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:59:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:53,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:54,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {7631#true} call ULTIMATE.init(); {7631#true} is VALID [2022-04-28 02:59:54,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {7631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {7631#true} is VALID [2022-04-28 02:59:54,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {7631#true} assume true; {7631#true} is VALID [2022-04-28 02:59:54,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7631#true} {7631#true} #96#return; {7631#true} is VALID [2022-04-28 02:59:54,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {7631#true} call #t~ret6 := main(); {7631#true} is VALID [2022-04-28 02:59:54,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {7631#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:54,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {7636#(= main_~x~0 0)} [156] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_834 v_main_~x~0_812) (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) InVars {main_~x~0=v_main_~x~0_834, main_#t~post5=|v_main_#t~post5_79|} OutVars{main_~x~0=v_main_~x~0_812, main_#t~post5=|v_main_#t~post5_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:54,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {7636#(= main_~x~0 0)} [157] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7636#(= main_~x~0 0)} is VALID [2022-04-28 02:59:54,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(= main_~x~0 0)} [158] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_71 2) 0)) (.cse2 (< (mod v_main_~x~0_833 4294967296) 99)) (.cse0 (= v_main_~x~0_833 v_main_~x~0_823))) (or (and (= v_main_~y~0_71 v_main_~y~0_71) .cse0) (and (< 0 (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_833 (* v_main_~x~0_823 19)) 20) 0) .cse1 .cse2 (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_833 (* v_it_30 20)) 4294967296) 99) (not (<= 1 v_it_30))))) (and (or (not .cse1) (not .cse2)) .cse0))) InVars {main_~x~0=v_main_~x~0_833, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_823, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[main_~x~0] {7669#(or (= main_~x~0 0) (and (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_30)) (< (mod (* v_it_30 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 02:59:54,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {7669#(or (= main_~x~0 0) (and (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_30)) (< (mod (* v_it_30 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0)))} [155] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7673#(and (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_30)) (< (mod (* v_it_30 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 02:59:54,624 INFO L272 TraceCheckUtils]: 10: Hoare triple {7673#(and (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (* (- 1) main_~x~0) (- 20)))) (not (<= 1 v_it_30)) (< (mod (* v_it_30 20) 4294967296) 99))) (= (mod (* 19 main_~x~0) 20) 0) (< 0 (div (* (- 1) main_~x~0) (- 20))) (= (mod main_~y~0 2) 0) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:54,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {7677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:54,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7632#false} is VALID [2022-04-28 02:59:54,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7632#false} assume !false; {7632#false} is VALID [2022-04-28 02:59:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:54,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:01,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {7632#false} assume !false; {7632#false} is VALID [2022-04-28 03:00:01,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {7681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7632#false} is VALID [2022-04-28 03:00:01,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {7677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:00:01,201 INFO L272 TraceCheckUtils]: 10: Hoare triple {7638#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:01,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {7700#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} [155] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7638#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 03:00:03,207 WARN L290 TraceCheckUtils]: 8: Hoare triple {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [158] L45-1-->L17-2_primed: Formula: (let ((.cse1 (= (mod v_main_~y~0_71 2) 0)) (.cse2 (< (mod v_main_~x~0_833 4294967296) 99)) (.cse0 (= v_main_~x~0_833 v_main_~x~0_823))) (or (and (= v_main_~y~0_71 v_main_~y~0_71) .cse0) (and (< 0 (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20))) (= (mod (+ v_main_~x~0_833 (* v_main_~x~0_823 19)) 20) 0) .cse1 .cse2 (forall ((v_it_30 Int)) (or (not (<= (+ v_it_30 1) (div (+ v_main_~x~0_833 (* v_main_~x~0_823 (- 1))) (- 20)))) (< (mod (+ v_main_~x~0_833 (* v_it_30 20)) 4294967296) 99) (not (<= 1 v_it_30))))) (and (or (not .cse1) (not .cse2)) .cse0))) InVars {main_~x~0=v_main_~x~0_833, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_823, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[main_~x~0] {7700#(or (< (mod main_~x~0 4294967296) 99) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))))} is UNKNOWN [2022-04-28 03:00:05,231 WARN L290 TraceCheckUtils]: 7: Hoare triple {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [157] L17-2_primed-->L45-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is UNKNOWN [2022-04-28 03:00:07,237 WARN L290 TraceCheckUtils]: 6: Hoare triple {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} [156] L45-1-->L17-2_primed: Formula: (and (= v_main_~x~0_834 v_main_~x~0_812) (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) InVars {main_~x~0=v_main_~x~0_834, main_#t~post5=|v_main_#t~post5_79|} OutVars{main_~x~0=v_main_~x~0_812, main_#t~post5=|v_main_#t~post5_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is UNKNOWN [2022-04-28 03:00:07,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {7631#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7704#(and (forall ((aux_div_v_main_~x~0_842_32 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int) (aux_div_aux_mod_v_main_~x~0_842_32_109 Int) (aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 Int)) (or (<= 2 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (< aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 1) (exists ((v_it_30 Int)) (and (<= 1 v_it_30) (not (< (mod (+ main_~x~0 (* v_it_30 20)) 4294967296) 99)) (<= (+ v_it_30 1) (div (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0) (- 20))))) (< (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20)) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 99)) (not (= (mod (+ (* 19 aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116) main_~x~0 (* 18 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) 20) 0)) (<= aux_div_aux_mod_v_main_~x~0_842_32_109 0) (<= (+ (* 4294967296 aux_div_v_main_~x~0_842_32) 4294967296) (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116))) (<= (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_842_32_109_116 20 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_842_32_109_116)) (+ main_~x~0 (* aux_div_aux_mod_v_main_~x~0_842_32_109 20))))) (<= (div (+ 98 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-28 03:00:07,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {7631#true} call #t~ret6 := main(); {7631#true} is VALID [2022-04-28 03:00:07,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7631#true} {7631#true} #96#return; {7631#true} is VALID [2022-04-28 03:00:07,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {7631#true} assume true; {7631#true} is VALID [2022-04-28 03:00:07,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {7631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {7631#true} is VALID [2022-04-28 03:00:07,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {7631#true} call ULTIMATE.init(); {7631#true} is VALID [2022-04-28 03:00:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:00:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897068619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:07,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 03:00:09,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30305925] [2022-04-28 03:00:09,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30305925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:09,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:09,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:00:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618207822] [2022-04-28 03:00:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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 77 [2022-04-28 03:00:09,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:09,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-28 03:00:09,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:00:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:00:09,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3685, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:00:09,306 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-28 03:00:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:14,888 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2022-04-28 03:00:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:00:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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 77 [2022-04-28 03:00:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-28 03:00:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 89 transitions. [2022-04-28 03:00:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-28 03:00:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 89 transitions. [2022-04-28 03:00:14,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 89 transitions. [2022-04-28 03:00:14,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:14,960 INFO L225 Difference]: With dead ends: 89 [2022-04-28 03:00:14,960 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:00:14,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=760, Invalid=12350, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 03:00:14,964 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:14,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 218 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:00:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:00:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:00:14,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:14,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:00:14,964 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:00:14,964 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:00:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:14,964 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:00:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:00:14,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:14,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:14,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:00:14,965 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:00:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:14,965 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:14,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:14,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:14,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:00:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2022-04-28 03:00:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:14,965 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-28 03:00:14,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:00:14,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:14,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:00:14,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:15,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:15,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:00:16,292 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 03:00:16,292 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 03:00:16,292 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 03:00:16,292 INFO L895 garLoopResultBuilder]: At program point L27-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (<= (+ main_~y~0 .cse4) .cse3)) (.cse1 (< .cse3 (+ main_~y~0 .cse4 1))) (.cse2 (= (mod main_~y~0 2) 0))) (or (and .cse0 (= 88 main_~x~0) .cse1) (and .cse0 .cse1 (= main_~x~0 48)) (and .cse2 (= main_~x~0 8)) (and .cse0 .cse1 (= 68 main_~x~0)) (and (= main_~x~0 28) .cse2) (and (not .cse2) (= (+ main_~x~0 1) 0))))) [2022-04-28 03:00:16,292 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 13 50) the Hoare annotation is: true [2022-04-28 03:00:16,292 INFO L895 garLoopResultBuilder]: At program point L36-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse1 (<= (+ main_~y~0 .cse4) .cse3)) (.cse2 (< .cse3 (+ main_~y~0 .cse4 1)))) (or (and (not .cse0) (= main_~x~0 1)) (and (= main_~x~0 74) .cse1 .cse2) (and .cse1 (= 94 main_~x~0) .cse2) (and .cse0 (= main_~x~0 34)) (and (= main_~x~0 14) .cse0) (and .cse1 (= main_~x~0 54) .cse2)))) [2022-04-28 03:00:16,292 INFO L895 garLoopResultBuilder]: At program point L24-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse2 (= (mod main_~y~0 2) 0)) (.cse0 (<= (+ main_~y~0 .cse4) .cse3)) (.cse1 (< .cse3 (+ main_~y~0 .cse4 1)))) (or (and .cse0 (= 66 main_~x~0) .cse1) (and .cse2 (= main_~x~0 6)) (and (not .cse2) (= main_~x~0 1)) (and .cse2 (= main_~x~0 26)) (and .cse0 (= main_~x~0 86) .cse1) (and .cse0 (= main_~x~0 46) .cse1)))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L45-1(lines 17 47) the Hoare annotation is: (let ((.cse0 (= (mod main_~y~0 2) 0))) (or (and (= main_~x~0 80) .cse0) (and .cse0 (= main_~x~0 20)) (= main_~x~0 0) (and (not .cse0) (= (+ 5 main_~x~0) 0)) (and .cse0 (= main_~x~0 100)) (and (= 40 main_~x~0) (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0))) (and (= main_~x~0 60) .cse0))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L33-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse1 (<= (+ main_~y~0 .cse4) .cse3)) (.cse2 (< .cse3 (+ main_~y~0 .cse4 1))) (.cse0 (= (mod main_~y~0 2) 0))) (or (and .cse0 (= 32 main_~x~0)) (and .cse1 (= main_~x~0 52) .cse2) (and (= main_~x~0 12) .cse0) (and (= 72 main_~x~0) .cse1 .cse2) (and .cse1 (= 92 main_~x~0) .cse2) (and (not .cse0) (= (+ main_~x~0 3) 0))))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L21-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (<= (+ main_~y~0 .cse4) .cse3)) (.cse1 (< .cse3 (+ main_~y~0 .cse4 1))) (.cse2 (= (mod main_~y~0 2) 0))) (or (and .cse0 .cse1 (= 84 main_~x~0)) (and (= main_~x~0 24) .cse2) (and .cse0 .cse1 (= 64 main_~x~0)) (and .cse0 (= 44 main_~x~0) .cse1) (and .cse2 (= main_~x~0 4)) (and (not .cse2) (= (+ main_~x~0 1) 0))))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 47) the Hoare annotation is: (let ((.cse1 (+ (* (div main_~y~0 2) 2) main_~x~0)) (.cse0 (* (div main_~x~0 2) 2))) (and (<= (+ main_~y~0 .cse0) .cse1) (< .cse1 (+ main_~y~0 .cse0 1)))) [2022-04-28 03:00:16,293 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 13 50) the Hoare annotation is: true [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L42-1(lines 17 47) the Hoare annotation is: (let ((.cse0 (= (mod main_~y~0 2) 0))) (or (and (= main_~x~0 58) .cse0) (and (= main_~x~0 78) .cse0) (and (= main_~x~0 18) .cse0) (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (= main_~x~0 38)) (and (not .cse0) (= (+ main_~x~0 1) 0)) (and (= 98 main_~x~0) .cse0))) [2022-04-28 03:00:16,293 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 50) the Hoare annotation is: true [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L30-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (<= (+ main_~y~0 .cse4) .cse3)) (.cse1 (< .cse3 (+ main_~y~0 .cse4 1))) (.cse2 (= (mod main_~y~0 2) 0))) (or (and (= main_~x~0 70) .cse0 .cse1) (and (not .cse2) (= main_~x~0 1)) (and .cse0 (= main_~x~0 50) .cse1) (and (= main_~x~0 10) .cse2) (and .cse0 (= main_~x~0 90) .cse1) (and .cse2 (= 30 main_~x~0))))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 19) the Hoare annotation is: (let ((.cse0 (= (mod main_~y~0 2) 0))) (or (and (= main_~x~0 80) .cse0) (and .cse0 (= main_~x~0 20)) (= main_~x~0 0) (and (= 40 main_~x~0) (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0))) (and (= main_~x~0 60) .cse0))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse1 (<= (+ main_~y~0 .cse4) .cse3)) (.cse2 (< .cse3 (+ main_~y~0 .cse4 1)))) (or (and (= main_~x~0 22) .cse0) (and (not .cse0) (= main_~x~0 1)) (and .cse0 (= main_~x~0 2)) (and .cse1 .cse2 (= 42 main_~x~0)) (and (= main_~x~0 82) .cse1 .cse2) (and (= main_~x~0 62) .cse1 .cse2)))) [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 17 47) the Hoare annotation is: (let ((.cse4 (* (div main_~x~0 2) 2)) (.cse3 (+ (* (div main_~y~0 2) 2) main_~x~0))) (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse1 (<= (+ main_~y~0 .cse4) .cse3)) (.cse2 (< .cse3 (+ main_~y~0 .cse4 1)))) (or (and (= main_~x~0 3) (not .cse0)) (and .cse0 (= main_~x~0 36)) (and .cse0 (= main_~x~0 16)) (and .cse1 .cse2 (= 76 main_~x~0)) (and (= main_~x~0 96) .cse1 .cse2) (and .cse1 .cse2 (= 56 main_~x~0))))) [2022-04-28 03:00:16,293 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,293 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:00:16,293 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,293 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L895 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:00:16,294 INFO L895 garLoopResultBuilder]: At program point L7(lines 7 9) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 03:00:16,294 INFO L902 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2022-04-28 03:00:16,294 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:00:16,296 INFO L356 BasicCegarLoop]: Path program histogram: [9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:16,297 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:00:16,300 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:00:16,302 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 03:00:16,343 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:00:16,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:00:16 BoogieIcfgContainer [2022-04-28 03:00:16,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:00:16,353 INFO L158 Benchmark]: Toolchain (without parser) took 212603.43ms. Allocated memory was 175.1MB in the beginning and 222.3MB in the end (delta: 47.2MB). Free memory was 124.6MB in the beginning and 110.6MB in the end (delta: 14.0MB). Peak memory consumption was 107.0MB. Max. memory is 8.0GB. [2022-04-28 03:00:16,354 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:00:16,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.62ms. Allocated memory is still 175.1MB. Free memory was 124.4MB in the beginning and 150.3MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:00:16,354 INFO L158 Benchmark]: Boogie Preprocessor took 19.88ms. Allocated memory is still 175.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:00:16,354 INFO L158 Benchmark]: RCFGBuilder took 260.89ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 136.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:00:16,354 INFO L158 Benchmark]: TraceAbstraction took 212131.25ms. Allocated memory was 175.1MB in the beginning and 222.3MB in the end (delta: 47.2MB). Free memory was 136.1MB in the beginning and 110.6MB in the end (delta: 25.5MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2022-04-28 03:00:16,356 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 175.1MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.62ms. Allocated memory is still 175.1MB. Free memory was 124.4MB in the beginning and 150.3MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.88ms. Allocated memory is still 175.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 260.89ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 136.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 212131.25ms. Allocated memory was 175.1MB in the beginning and 222.3MB in the end (delta: 47.2MB). Free memory was 136.1MB in the beginning and 110.6MB in the end (delta: 25.5MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 212.0s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 1734 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 379 IncrementalHoareTripleChecker+Unchecked, 1342 mSDsCounter, 899 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18323 IncrementalHoareTripleChecker+Invalid, 19601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 899 mSolverCounterUnsat, 392 mSDtfsCounter, 18323 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 451 SyntacticMatches, 70 SemanticMatches, 802 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11551 ImplicationChecksByTransitivity, 64.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=18, InterpolantAutomatonStates: 414, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 148 PreInvPairs, 260 NumberOfFragments, 1341 HoareAnnotationTreeSize, 148 FomulaSimplifications, 1332 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 5033 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((x == 80 && y % 2 == 0) || (y % 2 == 0 && x == 20)) || x == 0) || (!(y % 2 == 0) && 5 + x == 0)) || (y % 2 == 0 && x == 100)) || (40 == x && y + x / 2 * 2 <= y / 2 * 2 + x)) || (x == 60 && y % 2 == 0) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:00:16,387 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...