/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:17:36,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:17:36,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:17:36,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:17:36,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:17:36,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:17:36,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:17:36,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:17:36,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:17:36,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:17:36,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:17:36,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:17:36,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:17:36,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:17:36,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:17:36,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:17:36,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:17:36,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:17:36,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:17:36,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:17:36,188 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:17:36,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:17:36,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:17:36,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:17:36,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:17:36,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:17:36,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:17:36,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:17:36,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:17:36,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:17:36,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:17:36,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:17:36,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:17:36,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:17:36,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:17:36,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:17:36,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:17:36,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:17:36,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:17:36,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:17:36,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:17:36,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:17:36,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:17:36,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:17:36,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:17:36,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:17:36,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:17:36,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:17:36,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:17:36,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:17:36,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:17:36,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:17:36,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:17:36,233 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:17:36,233 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 09:17:36,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:17:36,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:17:36,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:17:36,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:17:36,416 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:17:36,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-28 09:17:36,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79582f1e4/b559feb95f2d487493b46383748763ac/FLAG4bab4ecb2 [2022-04-28 09:17:36,797 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:17:36,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-28 09:17:36,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79582f1e4/b559feb95f2d487493b46383748763ac/FLAG4bab4ecb2 [2022-04-28 09:17:37,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79582f1e4/b559feb95f2d487493b46383748763ac [2022-04-28 09:17:37,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:17:37,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:17:37,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:17:37,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:17:37,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:17:37,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2b607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37, skipping insertion in model container [2022-04-28 09:17:37,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:17:37,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:17:37,373 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/phases_1-1.c[322,335] [2022-04-28 09:17:37,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:17:37,408 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:17:37,416 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/phases_1-1.c[322,335] [2022-04-28 09:17:37,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:17:37,425 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:17:37,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37 WrapperNode [2022-04-28 09:17:37,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:17:37,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:17:37,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:17:37,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:17:37,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:17:37,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:17:37,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:17:37,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:17:37,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (1/1) ... [2022-04-28 09:17:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:17:37,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:37,474 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 09:17:37,489 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 09:17:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:17:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:17:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:17:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:17:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:17:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:17:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:17:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:17:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:17:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:17:37,566 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:17:37,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:17:37,640 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:17:37,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:17:37,645 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:17:37,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:17:37 BoogieIcfgContainer [2022-04-28 09:17:37,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:17:37,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:17:37,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:17:37,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:17:37,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:17:37" (1/3) ... [2022-04-28 09:17:37,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62826cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:17:37, skipping insertion in model container [2022-04-28 09:17:37,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:17:37" (2/3) ... [2022-04-28 09:17:37,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62826cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:17:37, skipping insertion in model container [2022-04-28 09:17:37,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:17:37" (3/3) ... [2022-04-28 09:17:37,651 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2022-04-28 09:17:37,659 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:17:37,660 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:17:37,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:17:37,725 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@3e0c065a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24cf5c27 [2022-04-28 09:17:37,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:17:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:17:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:17:37,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:37,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:37,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-28 09:17:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:37,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709368381] [2022-04-28 09:17:37,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:17:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-28 09:17:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789470290] [2022-04-28 09:17:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:37,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 09:17:37,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:17:37,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 09:17:37,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:37,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 09:17:37,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:17:37,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 09:17:37,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-28 09:17:37,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-28 09:17:37,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 09:17:37,878 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-28 09:17:37,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 09:17:37,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 09:17:37,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 09:17:37,879 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 09:17:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789470290] [2022-04-28 09:17:37,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789470290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:37,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:37,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:17:37,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:37,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709368381] [2022-04-28 09:17:37,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709368381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:37,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:37,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:17:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371665286] [2022-04-28 09:17:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:37,886 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 09:17:37,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:37,889 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 09:17:37,901 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 09:17:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:17:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:17:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:17:37,917 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:37,966 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 09:17:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:17:37,967 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 09:17:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:37,967 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 09:17:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 09:17:37,972 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 09:17:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 09:17:37,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 09:17:38,007 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 09:17:38,012 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:17:38,013 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 09:17:38,015 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 09:17:38,020 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:38,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 09:17:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 09:17:38,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:38,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,046 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,046 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,048 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 09:17:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:17:38,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:17:38,049 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:17:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,050 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 09:17:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:17:38,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:38,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 09:17:38,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 09:17:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:38,053 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 09:17:38,053 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 09:17:38,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 09:17:38,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:17:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:17:38,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:38,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:38,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:17:38,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-28 09:17:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574869463] [2022-04-28 09:17:38,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:17:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-28 09:17:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:38,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9301905] [2022-04-28 09:17:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:38,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 09:17:38,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 09:17:38,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 09:17:38,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:38,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 09:17:38,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 09:17:38,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 09:17:38,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-28 09:17:38,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {143#false} is VALID [2022-04-28 09:17:38,175 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-28 09:17:38,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 09:17:38,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 09:17:38,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 09:17:38,175 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 09:17:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9301905] [2022-04-28 09:17:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9301905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:38,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:38,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:17:38,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [574869463] [2022-04-28 09:17:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [574869463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:38,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:38,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:17:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150797217] [2022-04-28 09:17:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:38,178 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 09:17:38,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:38,178 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 09:17:38,223 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 09:17:38,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:17:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:17:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:17:38,230 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,298 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 09:17:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:17:38,309 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 09:17:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:38,309 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 09:17:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:17:38,316 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 09:17:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:17:38,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 09:17:38,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,346 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:17:38,346 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:17:38,347 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 09:17:38,352 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:38,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:17:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:17:38,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:38,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 09:17:38,359 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 09:17:38,360 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 09:17:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,362 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:17:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:17:38,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:17:38,363 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:17:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,365 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:17:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:17:38,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:38,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 09:17:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 09:17:38,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 09:17:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:38,367 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 09:17:38,369 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 09:17:38,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 09:17:38,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:17:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:17:38,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:38,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:38,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:17:38,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-28 09:17:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1683574378] [2022-04-28 09:17:38,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:38,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 2 times [2022-04-28 09:17:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:38,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983248431] [2022-04-28 09:17:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:38,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#(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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 09:17:38,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 09:17:38,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 09:17:38,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:38,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 09:17:38,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 09:17:38,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 09:17:38,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 09:17:38,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {262#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {263#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:38,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {258#false} is VALID [2022-04-28 09:17:38,527 INFO L272 TraceCheckUtils]: 9: Hoare triple {258#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-28 09:17:38,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-28 09:17:38,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-28 09:17:38,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 09:17:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:38,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983248431] [2022-04-28 09:17:38,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983248431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:38,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85647806] [2022-04-28 09:17:38,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:38,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:38,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:38,532 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 09:17:38,533 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 09:17:38,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:38,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:38,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:17:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:38,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:38,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2022-04-28 09:17:38,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 09:17:38,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 09:17:38,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 09:17:38,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 09:17:38,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {262#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {289#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-28 09:17:38,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {258#false} is VALID [2022-04-28 09:17:38,634 INFO L272 TraceCheckUtils]: 9: Hoare triple {258#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-28 09:17:38,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-28 09:17:38,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-28 09:17:38,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 09:17:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:38,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:38,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 09:17:38,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-28 09:17:38,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-28 09:17:38,705 INFO L272 TraceCheckUtils]: 9: Hoare triple {258#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-28 09:17:38,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {317#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {258#false} is VALID [2022-04-28 09:17:38,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {317#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:17:38,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {321#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:17:38,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {321#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-28 09:17:38,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 09:17:38,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 09:17:38,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 09:17:38,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 09:17:38,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2022-04-28 09:17:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:38,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85647806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:38,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:38,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 09:17:38,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:38,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1683574378] [2022-04-28 09:17:38,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1683574378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:38,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:38,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:17:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084658295] [2022-04-28 09:17:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:17:38,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:38,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:17:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:17:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:17:38,728 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,808 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 09:17:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:17:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:17:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:17:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 09:17:38,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 09:17:38,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,835 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:17:38,835 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:17:38,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:17:38,841 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:38,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:17:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:17:38,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:38,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 09:17:38,855 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 09:17:38,855 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 09:17:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,856 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:17:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:17:38,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 17 states. [2022-04-28 09:17:38,859 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 17 states. [2022-04-28 09:17:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:38,860 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:17:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:17:38,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:38,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:38,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:38,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 09:17:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 09:17:38,863 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-28 09:17:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:38,864 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 09:17:38,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 09:17:38,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:17:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:17:38,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:38,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:38,909 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 09:17:39,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:39,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:39,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1162777244, now seen corresponding path program 3 times [2022-04-28 09:17:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:39,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189690861] [2022-04-28 09:17:39,100 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:39,100 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1162777244, now seen corresponding path program 4 times [2022-04-28 09:17:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:39,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160678100] [2022-04-28 09:17:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:39,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {473#(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(13, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 09:17:39,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 09:17:39,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {465#true} {465#true} #40#return; {465#true} is VALID [2022-04-28 09:17:39,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {473#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:39,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {473#(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(13, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 09:17:39,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 09:17:39,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #40#return; {465#true} is VALID [2022-04-28 09:17:39,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret5 := main(); {465#true} is VALID [2022-04-28 09:17:39,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~x~0 := 0; {470#(= main_~x~0 0)} is VALID [2022-04-28 09:17:39,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {470#(= main_~x~0 0)} is VALID [2022-04-28 09:17:39,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:39,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:39,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {472#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:39,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {466#false} is VALID [2022-04-28 09:17:39,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {466#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {466#false} is VALID [2022-04-28 09:17:39,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2022-04-28 09:17:39,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#false} assume 0 == ~cond; {466#false} is VALID [2022-04-28 09:17:39,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 09:17:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:39,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:39,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160678100] [2022-04-28 09:17:39,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160678100] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:39,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134411365] [2022-04-28 09:17:39,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:39,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:39,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:39,177 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 09:17:39,193 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 09:17:39,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:39,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:39,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:17:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:39,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:39,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2022-04-28 09:17:39,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#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(13, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 09:17:39,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 09:17:39,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #40#return; {465#true} is VALID [2022-04-28 09:17:39,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret5 := main(); {465#true} is VALID [2022-04-28 09:17:39,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~x~0 := 0; {470#(= main_~x~0 0)} is VALID [2022-04-28 09:17:39,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {470#(= main_~x~0 0)} is VALID [2022-04-28 09:17:39,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:39,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:39,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:39,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:39,475 INFO L272 TraceCheckUtils]: 11: Hoare triple {504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:39,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:39,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {466#false} is VALID [2022-04-28 09:17:39,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 09:17:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:39,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:39,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 09:17:39,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {466#false} is VALID [2022-04-28 09:17:39,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:39,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {531#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:39,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {531#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {531#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:39,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {531#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:39,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {538#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:39,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {538#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:39,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {531#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:39,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~x~0 := 0; {531#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:39,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret5 := main(); {465#true} is VALID [2022-04-28 09:17:39,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #40#return; {465#true} is VALID [2022-04-28 09:17:39,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 09:17:39,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#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(13, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 09:17:39,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2022-04-28 09:17:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:17:39,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134411365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:39,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:39,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2022-04-28 09:17:39,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189690861] [2022-04-28 09:17:39,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189690861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:39,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:39,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:17:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910883378] [2022-04-28 09:17:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:17:39,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:39,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 09:17:39,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:39,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:17:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:17:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:17:39,583 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 09:17:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:39,685 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:17:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:17:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:17:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 09:17:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 09:17:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 09:17:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 09:17:39,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-28 09:17:39,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:39,711 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:17:39,712 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 09:17:39,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:17:39,712 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:39,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 09:17:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 09:17:39,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:39,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 09:17:39,720 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 09:17:39,720 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 09:17:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:39,721 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:17:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:17:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:39,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:39,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 19 states. [2022-04-28 09:17:39,722 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 19 states. [2022-04-28 09:17:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:39,722 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:17:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:17:39,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:39,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:39,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:39,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 09:17:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 09:17:39,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-28 09:17:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:39,724 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 09:17:39,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 09:17:39,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 09:17:39,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:17:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:17:39,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:39,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:39,755 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 09:17:39,940 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,SelfDestructingSolverStorable3 [2022-04-28 09:17:39,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1812766649, now seen corresponding path program 5 times [2022-04-28 09:17:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:39,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297457126] [2022-04-28 09:17:39,967 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:39,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1812766649, now seen corresponding path program 6 times [2022-04-28 09:17:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:39,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984559024] [2022-04-28 09:17:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:40,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#(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(13, 2);call #Ultimate.allocInit(12, 3); {702#true} is VALID [2022-04-28 09:17:40,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 09:17:40,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #40#return; {702#true} is VALID [2022-04-28 09:17:40,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:40,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#(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(13, 2);call #Ultimate.allocInit(12, 3); {702#true} is VALID [2022-04-28 09:17:40,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 09:17:40,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #40#return; {702#true} is VALID [2022-04-28 09:17:40,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret5 := main(); {702#true} is VALID [2022-04-28 09:17:40,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} ~x~0 := 0; {707#(= main_~x~0 0)} is VALID [2022-04-28 09:17:40,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {707#(= main_~x~0 0)} is VALID [2022-04-28 09:17:40,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {708#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:40,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {708#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {708#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:40,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {709#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:40,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {709#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:40,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {710#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:17:40,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 268435455); {703#false} is VALID [2022-04-28 09:17:40,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {703#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {703#false} is VALID [2022-04-28 09:17:40,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2022-04-28 09:17:40,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2022-04-28 09:17:40,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-04-28 09:17:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984559024] [2022-04-28 09:17:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984559024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279590537] [2022-04-28 09:17:40,094 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:40,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:40,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:40,095 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 09:17:40,123 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 09:17:40,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:17:40,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:40,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:17:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:40,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:40,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#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(13, 2);call #Ultimate.allocInit(12, 3); {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 09:17:40,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #40#return; {702#true} is VALID [2022-04-28 09:17:40,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret5 := main(); {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} ~x~0 := 0; {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#true} assume !!(~x~0 % 4294967296 < 268435455); {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {702#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {702#true} is VALID [2022-04-28 09:17:40,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {702#true} assume !!(~x~0 % 4294967296 < 268435455); {702#true} is VALID [2022-04-28 09:17:40,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {742#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:40,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {742#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {742#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:40,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {749#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-28 09:17:40,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 268435455); {703#false} is VALID [2022-04-28 09:17:40,535 INFO L272 TraceCheckUtils]: 13: Hoare triple {703#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {703#false} is VALID [2022-04-28 09:17:40,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2022-04-28 09:17:40,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2022-04-28 09:17:40,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-04-28 09:17:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:17:40,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:17:40,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279590537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:40,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:17:40,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-04-28 09:17:40,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297457126] [2022-04-28 09:17:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297457126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:40,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:40,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:17:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217070120] [2022-04-28 09:17:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2022-04-28 09:17:40,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:40,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 09:17:40,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:40,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:17:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:17:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:17:40,554 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 09:17:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:40,644 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 09:17:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:17:40,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2022-04-28 09:17:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 09:17:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:17:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 09:17:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:17:40,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 09:17:40,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:40,669 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:17:40,669 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:17:40,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:17:40,670 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:40,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:17:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 09:17:40,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:40,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 09:17:40,684 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 09:17:40,684 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 09:17:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:40,688 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:17:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:17:40,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:40,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:40,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 23 states. [2022-04-28 09:17:40,688 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 23 states. [2022-04-28 09:17:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:40,693 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:17:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 09:17:40,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:40,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:40,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:40,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 09:17:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 09:17:40,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2022-04-28 09:17:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:40,697 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 09:17:40,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 09:17:40,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 09:17:40,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:17:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:17:40,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:40,725 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:40,757 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 09:17:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:40,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 1 times [2022-04-28 09:17:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:40,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938005114] [2022-04-28 09:17:40,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:40,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 2 times [2022-04-28 09:17:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:40,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56895228] [2022-04-28 09:17:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:41,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#(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(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 09:17:41,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 09:17:41,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {906#true} {906#true} #40#return; {906#true} is VALID [2022-04-28 09:17:41,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:41,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#(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(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 09:17:41,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 09:17:41,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #40#return; {906#true} is VALID [2022-04-28 09:17:41,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 09:17:41,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0; {911#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {911#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {911#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {914#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:17:41,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 268435455); {914#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:17:41,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {914#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {907#false} is VALID [2022-04-28 09:17:41,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} assume !(~x~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-28 09:17:41,058 INFO L272 TraceCheckUtils]: 15: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-28 09:17:41,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-28 09:17:41,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-28 09:17:41,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 09:17:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56895228] [2022-04-28 09:17:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56895228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463817316] [2022-04-28 09:17:41,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:41,078 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 09:17:41,079 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 09:17:41,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:41,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:41,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:17:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:41,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:41,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 09:17:41,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 09:17:41,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 09:17:41,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #40#return; {906#true} is VALID [2022-04-28 09:17:41,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 09:17:41,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0; {911#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {911#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {911#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:41,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:41,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {907#false} is VALID [2022-04-28 09:17:41,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} assume !(~x~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-28 09:17:41,288 INFO L272 TraceCheckUtils]: 15: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-28 09:17:41,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-28 09:17:41,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-28 09:17:41,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 09:17:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:41,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:41,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 09:17:41,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-28 09:17:41,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-28 09:17:41,439 INFO L272 TraceCheckUtils]: 15: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-28 09:17:41,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} assume !(~x~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-28 09:17:41,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#(< (mod main_~x~0 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {907#false} is VALID [2022-04-28 09:17:41,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {993#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {989#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-28 09:17:41,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {993#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-28 09:17:41,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {997#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {997#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1004#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {1011#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1004#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1011#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1011#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0; {1011#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-28 09:17:41,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 09:17:41,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #40#return; {906#true} is VALID [2022-04-28 09:17:41,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 09:17:41,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 09:17:41,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 09:17:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463817316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:41,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:41,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-04-28 09:17:41,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938005114] [2022-04-28 09:17:41,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938005114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:41,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:41,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:17:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944447438] [2022-04-28 09:17:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-28 09:17:41,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:41,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 09:17:41,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:41,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:17:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:17:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:17:41,459 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 09:17:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:41,588 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 09:17:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:17:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-28 09:17:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 09:17:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 09:17:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 09:17:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 09:17:41,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 09:17:41,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:41,612 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:17:41,612 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:17:41,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:17:41,612 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:17:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 09:17:41,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:41,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,629 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,629 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:41,630 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:17:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:17:41,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:41,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:41,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,630 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:41,631 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:17:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:17:41,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:41,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:41,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:41,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 09:17:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 09:17:41,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2022-04-28 09:17:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:41,632 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 09:17:41,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 09:17:41,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 09:17:41,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:17:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:17:41,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:41,653 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:41,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:17:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:41,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 3 times [2022-04-28 09:17:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416752735] [2022-04-28 09:17:41,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:41,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 4 times [2022-04-28 09:17:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:41,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072543031] [2022-04-28 09:17:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:41,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {1201#(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(13, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 09:17:41,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 09:17:41,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #40#return; {1191#true} is VALID [2022-04-28 09:17:41,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:41,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#(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(13, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 09:17:41,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 09:17:41,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #40#return; {1191#true} is VALID [2022-04-28 09:17:41,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-28 09:17:41,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} ~x~0 := 0; {1196#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1196#(= main_~x~0 0)} is VALID [2022-04-28 09:17:41,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {1196#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:41,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:41,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:41,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:41,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1200#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:41,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1200#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {1200#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:41,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {1200#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1192#false} is VALID [2022-04-28 09:17:41,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !(~x~0 % 4294967296 < 268435455); {1192#false} is VALID [2022-04-28 09:17:41,985 INFO L272 TraceCheckUtils]: 17: Hoare triple {1192#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1192#false} is VALID [2022-04-28 09:17:41,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-28 09:17:41,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-28 09:17:41,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 09:17:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:41,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072543031] [2022-04-28 09:17:41,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072543031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:41,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379705841] [2022-04-28 09:17:41,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:41,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:41,987 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 09:17:41,988 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 09:17:42,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:42,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:42,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:17:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:42,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:42,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-28 09:17:42,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#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(13, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 09:17:42,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 09:17:42,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #40#return; {1191#true} is VALID [2022-04-28 09:17:42,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-28 09:17:42,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} ~x~0 := 0; {1196#(= main_~x~0 0)} is VALID [2022-04-28 09:17:42,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1196#(= main_~x~0 0)} is VALID [2022-04-28 09:17:42,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1196#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:42,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:42,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:42,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:42,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:42,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:42,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1199#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1244#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:42,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1244#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1244#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:42,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {1244#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1251#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:42,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1251#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {1251#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:42,268 INFO L272 TraceCheckUtils]: 17: Hoare triple {1251#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:42,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:42,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1192#false} is VALID [2022-04-28 09:17:42,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 09:17:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:42,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:42,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 09:17:42,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1192#false} is VALID [2022-04-28 09:17:42,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:42,376 INFO L272 TraceCheckUtils]: 17: Hoare triple {1278#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:42,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {1291#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1291#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1291#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:42,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1291#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:42,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {1291#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {1291#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1291#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:42,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1291#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:42,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} ~x~0 := 0; {1278#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:42,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-28 09:17:42,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #40#return; {1191#true} is VALID [2022-04-28 09:17:42,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 09:17:42,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#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(13, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 09:17:42,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-28 09:17:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 09:17:42,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379705841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:42,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:42,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2022-04-28 09:17:42,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:42,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1416752735] [2022-04-28 09:17:42,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1416752735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:42,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:42,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:17:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851598358] [2022-04-28 09:17:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:42,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 21 [2022-04-28 09:17:42,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:42,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 09:17:42,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:42,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:17:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:17:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:17:42,397 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 09:17:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,556 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 09:17:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:17:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 21 [2022-04-28 09:17:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 09:17:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 09:17:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 09:17:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 09:17:42,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-28 09:17:42,582 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 09:17:42,582 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:17:42,582 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:17:42,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:17:42,583 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:42,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:17:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 09:17:42,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:42,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,611 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,611 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,611 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 09:17:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:17:42,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:42,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:42,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,612 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,613 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-28 09:17:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:17:42,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:42,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:42,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:42,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 09:17:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 09:17:42,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2022-04-28 09:17:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:42,614 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 09:17:42,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 09:17:42,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 09:17:42,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 09:17:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:17:42,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:42,636 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:42,652 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 09:17:42,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:42,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 5 times [2022-04-28 09:17:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238513449] [2022-04-28 09:17:42,849 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:42,850 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 6 times [2022-04-28 09:17:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:42,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586348268] [2022-04-28 09:17:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:42,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:42,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {1514#(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(13, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 09:17:42,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 09:17:42,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1503#true} {1503#true} #40#return; {1503#true} is VALID [2022-04-28 09:17:42,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:42,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#(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(13, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 09:17:42,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 09:17:42,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #40#return; {1503#true} is VALID [2022-04-28 09:17:42,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret5 := main(); {1503#true} is VALID [2022-04-28 09:17:42,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} ~x~0 := 0; {1508#(= main_~x~0 0)} is VALID [2022-04-28 09:17:42,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1508#(= main_~x~0 0)} is VALID [2022-04-28 09:17:42,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1508#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:42,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:42,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:42,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:42,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:42,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:42,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:42,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:42,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1513#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:42,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1513#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1513#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:42,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1513#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1504#false} is VALID [2022-04-28 09:17:42,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {1504#false} assume !(~x~0 % 4294967296 < 268435455); {1504#false} is VALID [2022-04-28 09:17:42,984 INFO L272 TraceCheckUtils]: 19: Hoare triple {1504#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1504#false} is VALID [2022-04-28 09:17:42,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-04-28 09:17:42,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-04-28 09:17:42,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-28 09:17:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:42,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586348268] [2022-04-28 09:17:42,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586348268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:42,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373538722] [2022-04-28 09:17:42,985 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:42,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:42,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:43,000 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 09:17:43,014 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 09:17:43,059 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:17:43,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:43,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:17:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:43,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:43,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2022-04-28 09:17:43,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#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(13, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 09:17:43,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 09:17:43,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #40#return; {1503#true} is VALID [2022-04-28 09:17:43,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret5 := main(); {1503#true} is VALID [2022-04-28 09:17:43,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} ~x~0 := 0; {1508#(= main_~x~0 0)} is VALID [2022-04-28 09:17:43,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1508#(= main_~x~0 0)} is VALID [2022-04-28 09:17:43,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1508#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:43,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:43,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:43,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:43,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:43,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:43,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:43,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:43,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1512#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1563#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:43,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1563#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1563#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:43,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {1563#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1504#false} is VALID [2022-04-28 09:17:43,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {1504#false} assume !(~x~0 % 4294967296 < 268435455); {1504#false} is VALID [2022-04-28 09:17:43,252 INFO L272 TraceCheckUtils]: 19: Hoare triple {1504#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1504#false} is VALID [2022-04-28 09:17:43,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-04-28 09:17:43,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-04-28 09:17:43,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-28 09:17:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:43,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:43,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-28 09:17:43,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-04-28 09:17:43,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-04-28 09:17:43,494 INFO L272 TraceCheckUtils]: 19: Hoare triple {1504#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1504#false} is VALID [2022-04-28 09:17:43,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {1504#false} assume !(~x~0 % 4294967296 < 268435455); {1504#false} is VALID [2022-04-28 09:17:43,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {1600#(< (mod main_~x~0 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1504#false} is VALID [2022-04-28 09:17:43,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {1604#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {1600#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-28 09:17:43,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {1608#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1604#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-28 09:17:43,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {1608#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1608#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {1615#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1608#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {1615#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1615#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1615#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1622#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1629#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1622#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {1629#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-28 09:17:43,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {1636#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1629#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-28 09:17:43,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1636#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1636#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} ~x~0 := 0; {1636#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} is VALID [2022-04-28 09:17:43,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret5 := main(); {1503#true} is VALID [2022-04-28 09:17:43,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #40#return; {1503#true} is VALID [2022-04-28 09:17:43,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 09:17:43,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#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(13, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 09:17:43,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2022-04-28 09:17:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:43,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373538722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:43,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:43,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-28 09:17:43,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:43,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238513449] [2022-04-28 09:17:43,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238513449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:43,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:43,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:17:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441204298] [2022-04-28 09:17:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 23 [2022-04-28 09:17:43,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:43,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 09:17:43,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:43,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:17:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:17:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:17:43,521 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 09:17:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:43,769 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 09:17:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:17:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 23 [2022-04-28 09:17:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 09:17:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 09:17:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 09:17:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 09:17:43,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-28 09:17:43,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:43,796 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:17:43,796 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:17:43,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:17:43,797 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:43,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:17:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:17:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 09:17:43,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:43,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 09:17:43,825 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 09:17:43,825 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 09:17:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:43,825 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 09:17:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 09:17:43,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:43,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:43,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-04-28 09:17:43,826 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-04-28 09:17:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:43,827 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 09:17:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 09:17:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:43,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:43,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:43,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 09:17:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 09:17:43,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2022-04-28 09:17:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:43,828 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 09:17:43,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 09:17:43,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 09:17:43,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 09:17:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:17:43,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:43,853 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:43,858 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 09:17:44,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:44,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 7 times [2022-04-28 09:17:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:44,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582400812] [2022-04-28 09:17:44,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:44,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 8 times [2022-04-28 09:17:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:44,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615540088] [2022-04-28 09:17:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:44,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#(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(13, 2);call #Ultimate.allocInit(12, 3); {1844#true} is VALID [2022-04-28 09:17:44,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#true} assume true; {1844#true} is VALID [2022-04-28 09:17:44,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1844#true} {1844#true} #40#return; {1844#true} is VALID [2022-04-28 09:17:44,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1844#true} call ULTIMATE.init(); {1856#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:44,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#(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(13, 2);call #Ultimate.allocInit(12, 3); {1844#true} is VALID [2022-04-28 09:17:44,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {1844#true} assume true; {1844#true} is VALID [2022-04-28 09:17:44,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1844#true} {1844#true} #40#return; {1844#true} is VALID [2022-04-28 09:17:44,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1844#true} call #t~ret5 := main(); {1844#true} is VALID [2022-04-28 09:17:44,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1844#true} ~x~0 := 0; {1849#(= main_~x~0 0)} is VALID [2022-04-28 09:17:44,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1849#(= main_~x~0 0)} is VALID [2022-04-28 09:17:44,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:44,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:44,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:44,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:44,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:44,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:44,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:44,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:44,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:44,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:44,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1855#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:44,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {1855#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {1855#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:44,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1855#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {1845#false} assume !(~x~0 % 4294967296 < 268435455); {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L272 TraceCheckUtils]: 21: Hoare triple {1845#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {1845#false} ~cond := #in~cond; {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#false} assume 0 == ~cond; {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#false} assume !false; {1845#false} is VALID [2022-04-28 09:17:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615540088] [2022-04-28 09:17:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615540088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150915639] [2022-04-28 09:17:44,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:44,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:44,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:44,176 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 09:17:44,177 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 09:17:44,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:44,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:44,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:17:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:44,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:44,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {1844#true} call ULTIMATE.init(); {1844#true} is VALID [2022-04-28 09:17:44,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#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(13, 2);call #Ultimate.allocInit(12, 3); {1844#true} is VALID [2022-04-28 09:17:44,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1844#true} assume true; {1844#true} is VALID [2022-04-28 09:17:44,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1844#true} {1844#true} #40#return; {1844#true} is VALID [2022-04-28 09:17:44,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {1844#true} call #t~ret5 := main(); {1844#true} is VALID [2022-04-28 09:17:44,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {1844#true} ~x~0 := 0; {1849#(= main_~x~0 0)} is VALID [2022-04-28 09:17:44,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1849#(= main_~x~0 0)} is VALID [2022-04-28 09:17:44,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:44,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:44,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:44,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:44,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {1851#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:44,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:44,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {1852#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:44,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:44,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1853#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:44,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:44,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1911#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:44,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1911#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {1911#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:44,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1911#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:44,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:44,453 INFO L272 TraceCheckUtils]: 21: Hoare triple {1918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:44,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1929#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:44,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {1929#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1845#false} is VALID [2022-04-28 09:17:44,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#false} assume !false; {1845#false} is VALID [2022-04-28 09:17:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:44,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:44,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#false} assume !false; {1845#false} is VALID [2022-04-28 09:17:44,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {1929#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1845#false} is VALID [2022-04-28 09:17:44,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1929#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:44,578 INFO L272 TraceCheckUtils]: 21: Hoare triple {1945#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:44,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1958#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1958#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:44,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {1945#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1844#true} ~x~0 := 0; {1945#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:44,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1844#true} call #t~ret5 := main(); {1844#true} is VALID [2022-04-28 09:17:44,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1844#true} {1844#true} #40#return; {1844#true} is VALID [2022-04-28 09:17:44,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1844#true} assume true; {1844#true} is VALID [2022-04-28 09:17:44,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#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(13, 2);call #Ultimate.allocInit(12, 3); {1844#true} is VALID [2022-04-28 09:17:44,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {1844#true} call ULTIMATE.init(); {1844#true} is VALID [2022-04-28 09:17:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 09:17:44,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150915639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:44,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:44,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 6] total 16 [2022-04-28 09:17:44,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582400812] [2022-04-28 09:17:44,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582400812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:44,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:44,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:17:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930630501] [2022-04-28 09:17:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 25 [2022-04-28 09:17:44,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:44,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 09:17:44,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:17:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:17:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:17:44,609 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 09:17:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:44,895 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 09:17:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:17:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 25 [2022-04-28 09:17:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 09:17:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 09:17:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 09:17:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 09:17:44,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-28 09:17:44,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:44,927 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:17:44,927 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 09:17:44,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:17:44,928 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:44,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 44 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:17:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 09:17:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 09:17:44,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:44,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 09:17:44,959 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 09:17:44,960 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 09:17:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:44,960 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-28 09:17:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 09:17:44,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:44,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:44,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 28 states. [2022-04-28 09:17:44,961 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 28 states. [2022-04-28 09:17:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:44,961 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-28 09:17:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 09:17:44,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:44,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:44,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:44,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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 09:17:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-28 09:17:44,962 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2022-04-28 09:17:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:44,963 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-28 09:17:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 09:17:44,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-28 09:17:44,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-28 09:17:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 09:17:44,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:44,991 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:45,010 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 09:17:45,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:45,203 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 9 times [2022-04-28 09:17:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1359394592] [2022-04-28 09:17:45,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:45,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 10 times [2022-04-28 09:17:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:45,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868944016] [2022-04-28 09:17:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:45,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {2223#(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(13, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-28 09:17:45,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 09:17:45,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-28 09:17:45,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:45,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#(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(13, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-28 09:17:45,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 09:17:45,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-28 09:17:45,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-28 09:17:45,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2215#(= main_~x~0 0)} is VALID [2022-04-28 09:17:45,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {2215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2215#(= main_~x~0 0)} is VALID [2022-04-28 09:17:45,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:45,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:45,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:45,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:45,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:45,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:45,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:45,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:45,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:45,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:45,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:45,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:45,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:17:45,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 268435455); {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-28 09:17:45,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2211#false} is VALID [2022-04-28 09:17:45,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {2211#false} assume !(~x~0 % 4294967296 < 268435455); {2211#false} is VALID [2022-04-28 09:17:45,344 INFO L272 TraceCheckUtils]: 23: Hoare triple {2211#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2211#false} is VALID [2022-04-28 09:17:45,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-04-28 09:17:45,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-04-28 09:17:45,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-28 09:17:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868944016] [2022-04-28 09:17:45,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868944016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008148134] [2022-04-28 09:17:45,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:45,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:45,346 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 09:17:45,355 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 09:17:45,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:45,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:45,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:17:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:45,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:45,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-28 09:17:45,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#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(13, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-28 09:17:45,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 09:17:45,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-28 09:17:45,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-28 09:17:45,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2215#(= main_~x~0 0)} is VALID [2022-04-28 09:17:45,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {2215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2215#(= main_~x~0 0)} is VALID [2022-04-28 09:17:45,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:45,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:45,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:45,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:45,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:45,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:45,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:45,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:45,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:45,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:45,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:45,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:45,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:45,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:45,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2291#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:45,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {2291#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2211#false} is VALID [2022-04-28 09:17:45,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {2211#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2211#false} is VALID [2022-04-28 09:17:45,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-04-28 09:17:45,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-04-28 09:17:45,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-28 09:17:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:45,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:45,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-28 09:17:45,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-04-28 09:17:45,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-04-28 09:17:45,892 INFO L272 TraceCheckUtils]: 23: Hoare triple {2211#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2211#false} is VALID [2022-04-28 09:17:45,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {2319#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2211#false} is VALID [2022-04-28 09:17:45,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {2323#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2319#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {2323#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2323#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2323#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2330#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2330#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {2337#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2330#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {2337#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2337#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {2344#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2337#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {2344#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2344#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2344#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {2351#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2351#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {2358#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2351#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2358#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2358#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2358#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {2365#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2365#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2372#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2365#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {2372#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2372#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2372#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:45,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-28 09:17:45,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-28 09:17:45,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-28 09:17:45,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#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(13, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-28 09:17:45,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-28 09:17:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008148134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:45,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:45,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-28 09:17:45,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:45,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1359394592] [2022-04-28 09:17:45,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1359394592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:45,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:45,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:17:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702458201] [2022-04-28 09:17:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 27 [2022-04-28 09:17:45,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:45,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 09:17:45,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:17:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:17:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:17:45,925 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 09:17:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:46,260 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 09:17:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:17:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 27 [2022-04-28 09:17:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 09:17:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 09:17:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 09:17:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 09:17:46,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-28 09:17:46,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:46,291 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:17:46,291 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:17:46,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:17:46,292 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:46,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:17:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:17:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 09:17:46,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:46,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 09:17:46,326 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 09:17:46,327 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 09:17:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:46,327 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:17:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:17:46,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:46,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:46,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 30 states. [2022-04-28 09:17:46,328 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 30 states. [2022-04-28 09:17:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:46,329 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:17:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:17:46,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:46,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:46,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:46,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 09:17:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-28 09:17:46,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2022-04-28 09:17:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:46,330 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-28 09:17:46,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 09:17:46,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-28 09:17:46,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:17:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:17:46,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:46,362 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:46,378 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 09:17:46,562 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,SelfDestructingSolverStorable9 [2022-04-28 09:17:46,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 11 times [2022-04-28 09:17:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:46,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069680519] [2022-04-28 09:17:46,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:46,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 12 times [2022-04-28 09:17:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314124747] [2022-04-28 09:17:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:46,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#(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(13, 2);call #Ultimate.allocInit(12, 3); {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#true} assume true; {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2608#true} {2608#true} #40#return; {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {2608#true} call ULTIMATE.init(); {2622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:46,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#(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(13, 2);call #Ultimate.allocInit(12, 3); {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#true} assume true; {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2608#true} {2608#true} #40#return; {2608#true} is VALID [2022-04-28 09:17:46,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {2608#true} call #t~ret5 := main(); {2608#true} is VALID [2022-04-28 09:17:46,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {2608#true} ~x~0 := 0; {2613#(= main_~x~0 0)} is VALID [2022-04-28 09:17:46,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {2613#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2613#(= main_~x~0 0)} is VALID [2022-04-28 09:17:46,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {2613#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:46,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2614#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:46,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {2614#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:46,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {2615#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2615#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:46,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2615#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:46,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {2616#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2616#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:46,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {2616#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:46,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:46,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {2617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2618#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:46,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {2618#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2618#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:46,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {2618#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2619#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:46,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {2619#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2619#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:46,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2619#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2620#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:46,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2620#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2620#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:46,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2620#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2621#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:46,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {2621#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {2621#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:46,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {2621#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2609#false} assume !(~x~0 % 4294967296 < 268435455); {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L272 TraceCheckUtils]: 25: Hoare triple {2609#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2609#false} ~cond := #in~cond; {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {2609#false} assume 0 == ~cond; {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {2609#false} assume !false; {2609#false} is VALID [2022-04-28 09:17:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314124747] [2022-04-28 09:17:46,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314124747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185377229] [2022-04-28 09:17:46,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:46,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:46,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:46,733 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 09:17:46,734 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 09:17:46,767 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:17:46,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:46,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:17:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:46,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:46,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {2608#true} call ULTIMATE.init(); {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#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(13, 2);call #Ultimate.allocInit(12, 3); {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#true} assume true; {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2608#true} {2608#true} #40#return; {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {2608#true} call #t~ret5 := main(); {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {2608#true} ~x~0 := 0; {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:46,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:46,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2689#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:46,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {2689#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {2689#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:46,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2696#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-28 09:17:46,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {2696#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {2609#false} is VALID [2022-04-28 09:17:46,980 INFO L272 TraceCheckUtils]: 25: Hoare triple {2609#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2609#false} is VALID [2022-04-28 09:17:46,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {2609#false} ~cond := #in~cond; {2609#false} is VALID [2022-04-28 09:17:46,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {2609#false} assume 0 == ~cond; {2609#false} is VALID [2022-04-28 09:17:46,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {2609#false} assume !false; {2609#false} is VALID [2022-04-28 09:17:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 09:17:46,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:47,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {2609#false} assume !false; {2609#false} is VALID [2022-04-28 09:17:47,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {2609#false} assume 0 == ~cond; {2609#false} is VALID [2022-04-28 09:17:47,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {2609#false} ~cond := #in~cond; {2609#false} is VALID [2022-04-28 09:17:47,190 INFO L272 TraceCheckUtils]: 25: Hoare triple {2609#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2609#false} is VALID [2022-04-28 09:17:47,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2609#false} is VALID [2022-04-28 09:17:47,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {2728#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2724#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:17:47,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {2728#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2728#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:47,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2728#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:47,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {2608#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#true} assume !!(~x~0 % 4294967296 < 268435455); {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {2608#true} ~x~0 := 0; {2608#true} is VALID [2022-04-28 09:17:47,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {2608#true} call #t~ret5 := main(); {2608#true} is VALID [2022-04-28 09:17:47,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2608#true} {2608#true} #40#return; {2608#true} is VALID [2022-04-28 09:17:47,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#true} assume true; {2608#true} is VALID [2022-04-28 09:17:47,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#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(13, 2);call #Ultimate.allocInit(12, 3); {2608#true} is VALID [2022-04-28 09:17:47,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {2608#true} call ULTIMATE.init(); {2608#true} is VALID [2022-04-28 09:17:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 09:17:47,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185377229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:47,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:47,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2022-04-28 09:17:47,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:47,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069680519] [2022-04-28 09:17:47,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069680519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:47,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:47,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:17:47,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234020851] [2022-04-28 09:17:47,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 09:17:47,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:47,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 09:17:47,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:47,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:17:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:17:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:17:47,234 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 09:17:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:47,587 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 09:17:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:17:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 09:17:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 09:17:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-28 09:17:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 09:17:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-28 09:17:47,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-28 09:17:47,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:47,620 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:17:47,620 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 09:17:47,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:17:47,621 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:47,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:17:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 09:17:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 09:17:47,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:47,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 09:17:47,662 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 09:17:47,662 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 09:17:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:47,662 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:17:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 09:17:47,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:47,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:47,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 32 states. [2022-04-28 09:17:47,663 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 32 states. [2022-04-28 09:17:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:47,663 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:17:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 09:17:47,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:47,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:47,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:47,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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 09:17:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-28 09:17:47,664 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2022-04-28 09:17:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:47,665 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-28 09:17:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 09:17:47,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-28 09:17:47,697 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 09:17:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 09:17:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 09:17:47,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:47,697 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:47,714 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 09:17:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:47,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 13 times [2022-04-28 09:17:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112729163] [2022-04-28 09:17:47,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:47,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 14 times [2022-04-28 09:17:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033688199] [2022-04-28 09:17:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:48,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {3041#(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(13, 2);call #Ultimate.allocInit(12, 3); {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3026#true} assume true; {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3026#true} {3026#true} #40#return; {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {3026#true} call ULTIMATE.init(); {3041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:48,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3041#(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(13, 2);call #Ultimate.allocInit(12, 3); {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {3026#true} assume true; {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3026#true} {3026#true} #40#return; {3026#true} is VALID [2022-04-28 09:17:48,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {3026#true} call #t~ret5 := main(); {3026#true} is VALID [2022-04-28 09:17:48,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {3026#true} ~x~0 := 0; {3031#(= main_~x~0 0)} is VALID [2022-04-28 09:17:48,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {3031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3031#(= main_~x~0 0)} is VALID [2022-04-28 09:17:48,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:48,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:48,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:48,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:48,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:48,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:48,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:48,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:48,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:48,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:48,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:48,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:48,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:48,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:48,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:48,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:48,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3040#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:48,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {3040#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3040#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:48,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {3040#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3027#false} is VALID [2022-04-28 09:17:48,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {3027#false} assume !(~x~0 % 4294967296 < 268435455); {3027#false} is VALID [2022-04-28 09:17:48,058 INFO L272 TraceCheckUtils]: 27: Hoare triple {3027#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3027#false} is VALID [2022-04-28 09:17:48,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {3027#false} ~cond := #in~cond; {3027#false} is VALID [2022-04-28 09:17:48,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {3027#false} assume 0 == ~cond; {3027#false} is VALID [2022-04-28 09:17:48,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#false} assume !false; {3027#false} is VALID [2022-04-28 09:17:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033688199] [2022-04-28 09:17:48,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033688199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475217144] [2022-04-28 09:17:48,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:48,060 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 09:17:48,061 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 09:17:48,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:48,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:48,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 09:17:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:48,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {3026#true} call ULTIMATE.init(); {3026#true} is VALID [2022-04-28 09:17:48,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {3026#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(13, 2);call #Ultimate.allocInit(12, 3); {3026#true} is VALID [2022-04-28 09:17:48,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {3026#true} assume true; {3026#true} is VALID [2022-04-28 09:17:48,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3026#true} {3026#true} #40#return; {3026#true} is VALID [2022-04-28 09:17:48,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {3026#true} call #t~ret5 := main(); {3026#true} is VALID [2022-04-28 09:17:48,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {3026#true} ~x~0 := 0; {3031#(= main_~x~0 0)} is VALID [2022-04-28 09:17:48,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {3031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3031#(= main_~x~0 0)} is VALID [2022-04-28 09:17:48,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:48,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:48,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {3032#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:48,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:48,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {3033#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:48,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:48,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {3034#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:48,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:48,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {3035#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:48,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:48,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {3036#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:48,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:48,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {3037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:48,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:48,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {3038#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:48,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:48,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {3039#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3114#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:48,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3114#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:48,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3121#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:48,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {3121#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3027#false} is VALID [2022-04-28 09:17:48,389 INFO L272 TraceCheckUtils]: 27: Hoare triple {3027#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3027#false} is VALID [2022-04-28 09:17:48,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {3027#false} ~cond := #in~cond; {3027#false} is VALID [2022-04-28 09:17:48,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {3027#false} assume 0 == ~cond; {3027#false} is VALID [2022-04-28 09:17:48,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#false} assume !false; {3027#false} is VALID [2022-04-28 09:17:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:48,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:48,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#false} assume !false; {3027#false} is VALID [2022-04-28 09:17:48,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {3027#false} assume 0 == ~cond; {3027#false} is VALID [2022-04-28 09:17:48,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {3027#false} ~cond := #in~cond; {3027#false} is VALID [2022-04-28 09:17:48,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {3027#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3027#false} is VALID [2022-04-28 09:17:48,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {3149#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3027#false} is VALID [2022-04-28 09:17:48,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {3153#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3149#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {3153#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3153#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {3160#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3153#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {3160#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3160#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {3167#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3160#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {3167#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3167#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {3174#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3167#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {3174#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3174#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {3181#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3174#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {3181#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3181#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {3188#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3181#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {3188#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3188#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {3195#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3188#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {3195#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3195#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {3202#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3195#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {3202#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3202#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {3209#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3202#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {3209#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3209#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {3216#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3209#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3216#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {3026#true} ~x~0 := 0; {3216#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-28 09:17:48,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {3026#true} call #t~ret5 := main(); {3026#true} is VALID [2022-04-28 09:17:48,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3026#true} {3026#true} #40#return; {3026#true} is VALID [2022-04-28 09:17:48,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3026#true} assume true; {3026#true} is VALID [2022-04-28 09:17:48,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3026#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(13, 2);call #Ultimate.allocInit(12, 3); {3026#true} is VALID [2022-04-28 09:17:48,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {3026#true} call ULTIMATE.init(); {3026#true} is VALID [2022-04-28 09:17:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:48,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475217144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:48,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:48,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2022-04-28 09:17:48,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:48,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112729163] [2022-04-28 09:17:48,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112729163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:48,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:48,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:17:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330042471] [2022-04-28 09:17:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 31 [2022-04-28 09:17:48,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:48,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 09:17:48,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:48,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:17:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:17:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:17:48,727 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 09:17:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:49,149 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 09:17:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:17:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 31 [2022-04-28 09:17:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 09:17:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-28 09:17:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 09:17:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-28 09:17:49,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 43 transitions. [2022-04-28 09:17:49,181 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 09:17:49,182 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:17:49,182 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 09:17:49,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=901, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:17:49,183 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:49,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:17:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 09:17:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 09:17:49,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:49,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,225 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,225 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:49,225 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 09:17:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 09:17:49,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:49,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:49,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,226 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:49,226 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 09:17:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 09:17:49,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:49,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:49,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:49,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 09:17:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 09:17:49,227 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2022-04-28 09:17:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 09:17:49,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 09:17:49,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 09:17:49,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 09:17:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:17:49,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:49,259 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:49,276 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 09:17:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 09:17:49,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 15 times [2022-04-28 09:17:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625279695] [2022-04-28 09:17:49,468 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:49,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 16 times [2022-04-28 09:17:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076507407] [2022-04-28 09:17:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:49,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {3496#(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(13, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-28 09:17:49,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-28 09:17:49,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3480#true} {3480#true} #40#return; {3480#true} is VALID [2022-04-28 09:17:49,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:49,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3496#(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(13, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-28 09:17:49,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-28 09:17:49,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #40#return; {3480#true} is VALID [2022-04-28 09:17:49,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret5 := main(); {3480#true} is VALID [2022-04-28 09:17:49,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0; {3485#(= main_~x~0 0)} is VALID [2022-04-28 09:17:49,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {3485#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3485#(= main_~x~0 0)} is VALID [2022-04-28 09:17:49,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {3485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:49,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:49,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:49,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:49,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:49,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:49,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:49,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:49,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:49,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:49,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:49,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:49,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:49,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:49,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:49,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:49,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:49,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:49,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3495#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:49,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {3495#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3495#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:49,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {3495#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3481#false} is VALID [2022-04-28 09:17:49,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {3481#false} assume !(~x~0 % 4294967296 < 268435455); {3481#false} is VALID [2022-04-28 09:17:49,639 INFO L272 TraceCheckUtils]: 29: Hoare triple {3481#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3481#false} is VALID [2022-04-28 09:17:49,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {3481#false} ~cond := #in~cond; {3481#false} is VALID [2022-04-28 09:17:49,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {3481#false} assume 0 == ~cond; {3481#false} is VALID [2022-04-28 09:17:49,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-28 09:17:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076507407] [2022-04-28 09:17:49,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076507407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368573938] [2022-04-28 09:17:49,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:49,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:17:49,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 09:17:49,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:49,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:49,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:17:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:49,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:49,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3480#true} is VALID [2022-04-28 09:17:49,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#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(13, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-28 09:17:49,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-28 09:17:49,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #40#return; {3480#true} is VALID [2022-04-28 09:17:49,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret5 := main(); {3480#true} is VALID [2022-04-28 09:17:49,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0; {3485#(= main_~x~0 0)} is VALID [2022-04-28 09:17:49,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {3485#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3485#(= main_~x~0 0)} is VALID [2022-04-28 09:17:49,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {3485#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:49,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:49,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:49,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:49,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {3487#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:49,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:49,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {3488#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:49,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:49,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {3489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:49,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:49,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {3490#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:49,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:49,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {3491#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:49,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:49,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {3492#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:49,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:49,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {3493#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:49,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:49,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3575#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:49,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {3575#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3575#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:49,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {3575#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:49,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {3582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:49,978 INFO L272 TraceCheckUtils]: 29: Hoare triple {3582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:49,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {3589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:49,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {3593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3481#false} is VALID [2022-04-28 09:17:49,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-28 09:17:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:49,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:50,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-28 09:17:50,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {3593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3481#false} is VALID [2022-04-28 09:17:50,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {3589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:50,125 INFO L272 TraceCheckUtils]: 29: Hoare triple {3609#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:50,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {3622#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3622#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:50,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0; {3609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:50,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret5 := main(); {3480#true} is VALID [2022-04-28 09:17:50,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #40#return; {3480#true} is VALID [2022-04-28 09:17:50,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-28 09:17:50,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#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(13, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-28 09:17:50,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3480#true} is VALID [2022-04-28 09:17:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 09:17:50,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368573938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:50,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:50,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 6] total 20 [2022-04-28 09:17:50,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625279695] [2022-04-28 09:17:50,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625279695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:50,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:50,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:17:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503554548] [2022-04-28 09:17:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:50,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,159 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 09:17:50,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:17:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:17:50,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:17:50,160 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:50,574 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-28 09:17:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:17:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-28 09:17:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-28 09:17:50,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-04-28 09:17:50,598 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 09:17:50,598 INFO L225 Difference]: With dead ends: 44 [2022-04-28 09:17:50,598 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 09:17:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:17:50,599 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:50,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:17:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 09:17:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 09:17:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:50,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 09:17:50,630 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 09:17:50,631 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 09:17:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:50,631 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 09:17:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 09:17:50,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:50,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:50,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 36 states. [2022-04-28 09:17:50,632 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 36 states. [2022-04-28 09:17:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:50,632 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 09:17:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 09:17:50,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:50,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:50,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:50,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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 09:17:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-28 09:17:50,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2022-04-28 09:17:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:50,633 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-28 09:17:50,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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 09:17:50,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2022-04-28 09:17:50,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-28 09:17:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 09:17:50,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:50,660 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:50,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 09:17:50,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:17:50,861 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 17 times [2022-04-28 09:17:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765425082] [2022-04-28 09:17:50,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:50,867 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 18 times [2022-04-28 09:17:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:50,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927232979] [2022-04-28 09:17:50,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:51,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {3971#(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(13, 2);call #Ultimate.allocInit(12, 3); {3954#true} is VALID [2022-04-28 09:17:51,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 09:17:51,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3954#true} {3954#true} #40#return; {3954#true} is VALID [2022-04-28 09:17:51,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {3954#true} call ULTIMATE.init(); {3971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:51,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {3971#(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(13, 2);call #Ultimate.allocInit(12, 3); {3954#true} is VALID [2022-04-28 09:17:51,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 09:17:51,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3954#true} {3954#true} #40#return; {3954#true} is VALID [2022-04-28 09:17:51,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {3954#true} call #t~ret5 := main(); {3954#true} is VALID [2022-04-28 09:17:51,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#true} ~x~0 := 0; {3959#(= main_~x~0 0)} is VALID [2022-04-28 09:17:51,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {3959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3959#(= main_~x~0 0)} is VALID [2022-04-28 09:17:51,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3960#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:51,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {3960#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3960#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:51,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {3960#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3961#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:51,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {3961#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3961#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:51,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {3961#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3962#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:51,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {3962#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3962#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:51,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {3962#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:51,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {3963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:51,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {3963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3964#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:51,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {3964#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3964#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:51,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {3964#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3965#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:51,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {3965#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3965#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:51,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {3965#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3966#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:51,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {3966#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3966#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:51,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {3966#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3967#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:51,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {3967#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3967#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:51,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {3967#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3968#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:51,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {3968#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3968#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:51,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {3968#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3969#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:51,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {3969#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3969#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:51,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {3969#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3970#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:51,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {3970#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3970#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:51,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {3970#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {3955#false} assume !(~x~0 % 4294967296 < 268435455); {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L272 TraceCheckUtils]: 31: Hoare triple {3955#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {3955#false} ~cond := #in~cond; {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {3955#false} assume 0 == ~cond; {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {3955#false} assume !false; {3955#false} is VALID [2022-04-28 09:17:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:51,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927232979] [2022-04-28 09:17:51,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927232979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125755132] [2022-04-28 09:17:51,060 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:51,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:51,061 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:17:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 09:17:51,099 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:17:51,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:51,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:17:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:51,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:51,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {3954#true} call ULTIMATE.init(); {3954#true} is VALID [2022-04-28 09:17:51,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#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(13, 2);call #Ultimate.allocInit(12, 3); {3954#true} is VALID [2022-04-28 09:17:51,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 09:17:51,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3954#true} {3954#true} #40#return; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {3954#true} call #t~ret5 := main(); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#true} ~x~0 := 0; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4056#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:51,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {4056#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:51,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {4056#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4063#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-28 09:17:51,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {4063#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {3955#false} is VALID [2022-04-28 09:17:51,212 INFO L272 TraceCheckUtils]: 31: Hoare triple {3955#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3955#false} is VALID [2022-04-28 09:17:51,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {3955#false} ~cond := #in~cond; {3955#false} is VALID [2022-04-28 09:17:51,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {3955#false} assume 0 == ~cond; {3955#false} is VALID [2022-04-28 09:17:51,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {3955#false} assume !false; {3955#false} is VALID [2022-04-28 09:17:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 09:17:51,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:51,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {3955#false} assume !false; {3955#false} is VALID [2022-04-28 09:17:51,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {4082#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3955#false} is VALID [2022-04-28 09:17:51,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {4086#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4082#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:17:51,652 INFO L272 TraceCheckUtils]: 31: Hoare triple {4090#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4086#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:51,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {4094#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {4090#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:51,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {4098#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4094#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:51,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {4098#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455); {4098#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4098#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {3954#true} assume !!(~x~0 % 4294967296 < 268435455); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#true} ~x~0 := 0; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {3954#true} call #t~ret5 := main(); {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3954#true} {3954#true} #40#return; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 09:17:51,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#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(13, 2);call #Ultimate.allocInit(12, 3); {3954#true} is VALID [2022-04-28 09:17:51,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {3954#true} call ULTIMATE.init(); {3954#true} is VALID [2022-04-28 09:17:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 09:17:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125755132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:51,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:51,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 7] total 22 [2022-04-28 09:17:51,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:51,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765425082] [2022-04-28 09:17:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765425082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:51,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:51,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:17:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286394005] [2022-04-28 09:17:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 35 [2022-04-28 09:17:51,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:51,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 09:17:51,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:17:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:17:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:17:51,676 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 09:17:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:52,299 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 09:17:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:17:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 35 [2022-04-28 09:17:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 09:17:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 09:17:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 09:17:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 09:17:52,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-28 09:17:52,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:52,335 INFO L225 Difference]: With dead ends: 46 [2022-04-28 09:17:52,335 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 09:17:52,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:17:52,336 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:52,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 54 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:17:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 09:17:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 09:17:52,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:52,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 09:17:52,388 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 09:17:52,388 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 09:17:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:52,390 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-28 09:17:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-28 09:17:52,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:52,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:52,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 38 states. [2022-04-28 09:17:52,390 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 38 states. [2022-04-28 09:17:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:52,391 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-28 09:17:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-28 09:17:52,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:52,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:52,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:52,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 09:17:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-04-28 09:17:52,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2022-04-28 09:17:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:52,392 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-04-28 09:17:52,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 09:17:52,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2022-04-28 09:17:52,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-28 09:17:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:17:52,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:52,427 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:52,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 09:17:52,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 09:17:52,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 19 times [2022-04-28 09:17:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871150335] [2022-04-28 09:17:52,633 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:52,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 20 times [2022-04-28 09:17:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:52,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178950074] [2022-04-28 09:17:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:52,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {4474#(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(13, 2);call #Ultimate.allocInit(12, 3); {4456#true} is VALID [2022-04-28 09:17:52,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {4456#true} assume true; {4456#true} is VALID [2022-04-28 09:17:52,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4456#true} {4456#true} #40#return; {4456#true} is VALID [2022-04-28 09:17:52,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {4456#true} call ULTIMATE.init(); {4474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:52,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {4474#(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(13, 2);call #Ultimate.allocInit(12, 3); {4456#true} is VALID [2022-04-28 09:17:52,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {4456#true} assume true; {4456#true} is VALID [2022-04-28 09:17:52,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4456#true} {4456#true} #40#return; {4456#true} is VALID [2022-04-28 09:17:52,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {4456#true} call #t~ret5 := main(); {4456#true} is VALID [2022-04-28 09:17:52,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {4456#true} ~x~0 := 0; {4461#(= main_~x~0 0)} is VALID [2022-04-28 09:17:52,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {4461#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4461#(= main_~x~0 0)} is VALID [2022-04-28 09:17:52,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {4461#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:52,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:52,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:52,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:52,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:52,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:52,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:52,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:52,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:52,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:52,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:52,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:52,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:52,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:52,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:52,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:52,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:52,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:52,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:52,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:52,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:52,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:52,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4473#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {4473#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {4473#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {4473#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4457#false} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {4457#false} assume !(~x~0 % 4294967296 < 268435455); {4457#false} is VALID [2022-04-28 09:17:52,855 INFO L272 TraceCheckUtils]: 33: Hoare triple {4457#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4457#false} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {4457#false} ~cond := #in~cond; {4457#false} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {4457#false} assume 0 == ~cond; {4457#false} is VALID [2022-04-28 09:17:52,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {4457#false} assume !false; {4457#false} is VALID [2022-04-28 09:17:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:52,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178950074] [2022-04-28 09:17:52,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178950074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:52,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895147634] [2022-04-28 09:17:52,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:52,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:52,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:52,857 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:17:52,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 09:17:52,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:52,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:52,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:17:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:52,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:53,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {4456#true} call ULTIMATE.init(); {4456#true} is VALID [2022-04-28 09:17:53,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {4456#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(13, 2);call #Ultimate.allocInit(12, 3); {4456#true} is VALID [2022-04-28 09:17:53,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4456#true} assume true; {4456#true} is VALID [2022-04-28 09:17:53,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4456#true} {4456#true} #40#return; {4456#true} is VALID [2022-04-28 09:17:53,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {4456#true} call #t~ret5 := main(); {4456#true} is VALID [2022-04-28 09:17:53,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {4456#true} ~x~0 := 0; {4461#(= main_~x~0 0)} is VALID [2022-04-28 09:17:53,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {4461#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4461#(= main_~x~0 0)} is VALID [2022-04-28 09:17:53,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {4461#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:53,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:53,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:53,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:53,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {4463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:53,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:53,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {4464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:53,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:53,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {4465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:53,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:53,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {4466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:53,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:53,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {4467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:53,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:53,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {4468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:53,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:53,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:53,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:53,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {4470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:53,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:53,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {4471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:53,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:53,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {4472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4565#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:53,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {4565#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4565#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:53,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {4565#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4572#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:53,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {4572#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 268435455); {4572#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:53,301 INFO L272 TraceCheckUtils]: 33: Hoare triple {4572#(and (<= 14 main_~x~0) (<= main_~x~0 14))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:53,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:53,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {4583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4457#false} is VALID [2022-04-28 09:17:53,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {4457#false} assume !false; {4457#false} is VALID [2022-04-28 09:17:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:53,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:53,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {4457#false} assume !false; {4457#false} is VALID [2022-04-28 09:17:53,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {4583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4457#false} is VALID [2022-04-28 09:17:53,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:53,497 INFO L272 TraceCheckUtils]: 33: Hoare triple {4599#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:53,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {4612#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4612#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-28 09:17:53,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {4599#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {4456#true} ~x~0 := 0; {4599#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:53,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {4456#true} call #t~ret5 := main(); {4456#true} is VALID [2022-04-28 09:17:53,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4456#true} {4456#true} #40#return; {4456#true} is VALID [2022-04-28 09:17:53,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {4456#true} assume true; {4456#true} is VALID [2022-04-28 09:17:53,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {4456#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(13, 2);call #Ultimate.allocInit(12, 3); {4456#true} is VALID [2022-04-28 09:17:53,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {4456#true} call ULTIMATE.init(); {4456#true} is VALID [2022-04-28 09:17:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 09:17:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895147634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:53,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 6] total 22 [2022-04-28 09:17:53,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:53,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871150335] [2022-04-28 09:17:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871150335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:53,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:17:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599840257] [2022-04-28 09:17:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:53,514 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 37 [2022-04-28 09:17:53,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:53,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 09:17:53,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:53,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:17:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:17:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:17:53,539 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 09:17:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:54,203 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-04-28 09:17:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:17:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 37 [2022-04-28 09:17:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 09:17:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 09:17:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 09:17:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 09:17:54,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-28 09:17:54,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:54,232 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:17:54,233 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 09:17:54,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:17:54,233 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:54,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:17:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 09:17:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 09:17:54,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:54,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 09:17:54,285 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 09:17:54,285 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 09:17:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:54,286 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:17:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:17:54,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:54,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:54,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 40 states. [2022-04-28 09:17:54,286 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 40 states. [2022-04-28 09:17:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:54,287 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:17:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:17:54,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:54,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:54,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:54,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 09:17:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-04-28 09:17:54,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2022-04-28 09:17:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-04-28 09:17:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 09:17:54,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 41 transitions. [2022-04-28 09:17:54,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:17:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:17:54,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:54,333 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:54,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 09:17:54,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 09:17:54,534 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 21 times [2022-04-28 09:17:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:54,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173878417] [2022-04-28 09:17:54,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:54,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 22 times [2022-04-28 09:17:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:54,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810804406] [2022-04-28 09:17:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:54,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {5003#(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(13, 2);call #Ultimate.allocInit(12, 3); {4984#true} is VALID [2022-04-28 09:17:54,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {4984#true} assume true; {4984#true} is VALID [2022-04-28 09:17:54,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4984#true} {4984#true} #40#return; {4984#true} is VALID [2022-04-28 09:17:54,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {4984#true} call ULTIMATE.init(); {5003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:54,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#(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(13, 2);call #Ultimate.allocInit(12, 3); {4984#true} is VALID [2022-04-28 09:17:54,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {4984#true} assume true; {4984#true} is VALID [2022-04-28 09:17:54,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4984#true} {4984#true} #40#return; {4984#true} is VALID [2022-04-28 09:17:54,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {4984#true} call #t~ret5 := main(); {4984#true} is VALID [2022-04-28 09:17:54,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {4984#true} ~x~0 := 0; {4989#(= main_~x~0 0)} is VALID [2022-04-28 09:17:54,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4989#(= main_~x~0 0)} is VALID [2022-04-28 09:17:54,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:54,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:54,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:54,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:54,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:54,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:54,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:54,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:54,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:54,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:54,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:54,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:54,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:54,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:54,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:54,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:54,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:54,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:54,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:54,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:54,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:54,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:54,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:54,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:54,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5002#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:54,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {5002#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5002#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:54,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {5002#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4985#false} is VALID [2022-04-28 09:17:54,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {4985#false} assume !(~x~0 % 4294967296 < 268435455); {4985#false} is VALID [2022-04-28 09:17:54,776 INFO L272 TraceCheckUtils]: 35: Hoare triple {4985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4985#false} is VALID [2022-04-28 09:17:54,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {4985#false} ~cond := #in~cond; {4985#false} is VALID [2022-04-28 09:17:54,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {4985#false} assume 0 == ~cond; {4985#false} is VALID [2022-04-28 09:17:54,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {4985#false} assume !false; {4985#false} is VALID [2022-04-28 09:17:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:54,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810804406] [2022-04-28 09:17:54,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810804406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:54,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257410462] [2022-04-28 09:17:54,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:54,778 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:17:54,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 09:17:54,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:54,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:54,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:17:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:54,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:55,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {4984#true} call ULTIMATE.init(); {4984#true} is VALID [2022-04-28 09:17:55,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {4984#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(13, 2);call #Ultimate.allocInit(12, 3); {4984#true} is VALID [2022-04-28 09:17:55,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {4984#true} assume true; {4984#true} is VALID [2022-04-28 09:17:55,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4984#true} {4984#true} #40#return; {4984#true} is VALID [2022-04-28 09:17:55,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {4984#true} call #t~ret5 := main(); {4984#true} is VALID [2022-04-28 09:17:55,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {4984#true} ~x~0 := 0; {4989#(= main_~x~0 0)} is VALID [2022-04-28 09:17:55,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4989#(= main_~x~0 0)} is VALID [2022-04-28 09:17:55,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:55,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:55,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {4990#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:55,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:55,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {4991#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:55,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:55,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {4992#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:55,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:55,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {4993#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:55,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:55,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {4994#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:55,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:55,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {4995#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:55,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:55,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {4996#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:55,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:55,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {4997#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:55,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:55,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {4998#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:55,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:55,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:55,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:55,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {5000#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:55,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:55,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5100#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-28 09:17:55,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {5100#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5100#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-28 09:17:55,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {5100#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5107#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-28 09:17:55,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {5107#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 268435455); {4985#false} is VALID [2022-04-28 09:17:55,188 INFO L272 TraceCheckUtils]: 35: Hoare triple {4985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4985#false} is VALID [2022-04-28 09:17:55,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {4985#false} ~cond := #in~cond; {4985#false} is VALID [2022-04-28 09:17:55,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {4985#false} assume 0 == ~cond; {4985#false} is VALID [2022-04-28 09:17:55,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {4985#false} assume !false; {4985#false} is VALID [2022-04-28 09:17:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:55,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:55,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {4985#false} assume !false; {4985#false} is VALID [2022-04-28 09:17:55,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {4985#false} assume 0 == ~cond; {4985#false} is VALID [2022-04-28 09:17:55,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {4985#false} ~cond := #in~cond; {4985#false} is VALID [2022-04-28 09:17:55,523 INFO L272 TraceCheckUtils]: 35: Hoare triple {4985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4985#false} is VALID [2022-04-28 09:17:55,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {5135#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4985#false} is VALID [2022-04-28 09:17:55,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {5139#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5135#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {5139#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5139#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {5146#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5139#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {5146#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5146#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {5153#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5146#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {5153#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5153#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {5160#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5153#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5160#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5160#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {5167#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5160#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {5167#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5167#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {5174#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5167#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {5174#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5174#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {5181#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5174#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {5181#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5181#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {5188#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5181#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {5188#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5188#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {5195#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5188#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {5195#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5195#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {5202#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5195#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {5202#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5202#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {5209#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5202#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {5209#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5209#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {5216#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5209#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {5216#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5216#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5216#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {5223#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5223#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {5230#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5223#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {5230#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5230#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {4984#true} ~x~0 := 0; {5230#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-28 09:17:55,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {4984#true} call #t~ret5 := main(); {4984#true} is VALID [2022-04-28 09:17:55,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4984#true} {4984#true} #40#return; {4984#true} is VALID [2022-04-28 09:17:55,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {4984#true} assume true; {4984#true} is VALID [2022-04-28 09:17:55,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {4984#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(13, 2);call #Ultimate.allocInit(12, 3); {4984#true} is VALID [2022-04-28 09:17:55,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {4984#true} call ULTIMATE.init(); {4984#true} is VALID [2022-04-28 09:17:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257410462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:55,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:55,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-04-28 09:17:55,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173878417] [2022-04-28 09:17:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173878417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:55,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:55,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 09:17:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7395654] [2022-04-28 09:17:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 39 [2022-04-28 09:17:55,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:55,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 09:17:55,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 09:17:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 09:17:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=803, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:17:55,571 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 09:17:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:56,256 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-04-28 09:17:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 09:17:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 39 [2022-04-28 09:17:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 09:17:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 09:17:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 09:17:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 09:17:56,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-28 09:17:56,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:56,291 INFO L225 Difference]: With dead ends: 50 [2022-04-28 09:17:56,291 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 09:17:56,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=1645, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 09:17:56,292 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:56,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:17:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 09:17:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 09:17:56,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:56,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,365 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,365 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:56,366 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 09:17:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-04-28 09:17:56,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:56,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:56,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,366 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:56,367 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 09:17:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-04-28 09:17:56,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:56,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:56,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:56,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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 09:17:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-04-28 09:17:56,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2022-04-28 09:17:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:56,368 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-04-28 09:17:56,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 09:17:56,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 43 transitions. [2022-04-28 09:17:56,406 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 09:17:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-04-28 09:17:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:17:56,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:56,406 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:56,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 09:17:56,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:56,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:56,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 23 times [2022-04-28 09:17:56,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:56,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [82095258] [2022-04-28 09:17:56,626 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:56,627 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 24 times [2022-04-28 09:17:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:56,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598373078] [2022-04-28 09:17:56,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:56,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {5570#(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(13, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-28 09:17:56,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-28 09:17:56,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5550#true} {5550#true} #40#return; {5550#true} is VALID [2022-04-28 09:17:56,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:56,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#(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(13, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-28 09:17:56,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-28 09:17:56,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #40#return; {5550#true} is VALID [2022-04-28 09:17:56,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret5 := main(); {5550#true} is VALID [2022-04-28 09:17:56,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} ~x~0 := 0; {5555#(= main_~x~0 0)} is VALID [2022-04-28 09:17:56,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {5555#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5555#(= main_~x~0 0)} is VALID [2022-04-28 09:17:56,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {5555#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5556#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:56,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {5556#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5556#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:17:56,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {5556#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5557#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:56,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {5557#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5557#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:56,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {5557#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5558#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:56,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {5558#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5558#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:17:56,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {5558#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5559#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:56,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {5559#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5559#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:56,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {5559#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:56,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {5560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:17:56,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {5560#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5561#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:56,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {5561#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5561#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:56,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {5561#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5562#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:56,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {5562#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5562#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-28 09:17:56,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {5562#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5563#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:56,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {5563#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5563#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:56,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {5563#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5564#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:56,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {5564#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5564#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-28 09:17:56,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {5564#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:56,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {5565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:56,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {5565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5566#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:56,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {5566#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5566#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-28 09:17:56,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {5566#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5567#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:56,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {5567#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5567#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:56,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {5567#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5568#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-28 09:17:56,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {5568#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5568#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-28 09:17:56,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {5568#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5569#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {5569#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5569#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {5569#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5551#false} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {5551#false} assume !(~x~0 % 4294967296 < 268435455); {5551#false} is VALID [2022-04-28 09:17:56,911 INFO L272 TraceCheckUtils]: 37: Hoare triple {5551#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5551#false} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {5551#false} ~cond := #in~cond; {5551#false} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {5551#false} assume 0 == ~cond; {5551#false} is VALID [2022-04-28 09:17:56,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2022-04-28 09:17:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598373078] [2022-04-28 09:17:56,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598373078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:56,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663510613] [2022-04-28 09:17:56,912 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:56,931 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:17:56,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 09:17:56,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:17:56,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:56,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:17:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:57,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:57,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5550#true} is VALID [2022-04-28 09:17:57,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#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(13, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-28 09:17:57,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #40#return; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret5 := main(); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} ~x~0 := 0; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5673#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:57,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {5673#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {5673#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-28 09:17:57,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {5673#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5680#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-28 09:17:57,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {5680#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 268435455); {5680#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-28 09:17:57,339 INFO L272 TraceCheckUtils]: 37: Hoare triple {5680#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:57,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:57,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {5691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5551#false} is VALID [2022-04-28 09:17:57,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2022-04-28 09:17:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 09:17:57,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:57,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {5551#false} assume !false; {5551#false} is VALID [2022-04-28 09:17:57,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {5691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5551#false} is VALID [2022-04-28 09:17:57,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:57,868 INFO L272 TraceCheckUtils]: 37: Hoare triple {5707#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:57,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {5707#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {5707#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:57,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {5714#(or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5707#(= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:57,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {5718#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455); {5714#(or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5718#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {5550#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {5550#true} assume !!(~x~0 % 4294967296 < 268435455); {5550#true} is VALID [2022-04-28 09:17:57,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} ~x~0 := 0; {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {5550#true} call #t~ret5 := main(); {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5550#true} {5550#true} #40#return; {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume true; {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#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(13, 2);call #Ultimate.allocInit(12, 3); {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {5550#true} call ULTIMATE.init(); {5550#true} is VALID [2022-04-28 09:17:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 09:17:57,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663510613] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:57,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:17:57,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 6] total 25 [2022-04-28 09:17:57,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:57,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [82095258] [2022-04-28 09:17:57,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [82095258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:57,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:57,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:17:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247511546] [2022-04-28 09:17:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:57,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 41 [2022-04-28 09:17:57,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:57,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 09:17:57,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:57,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:17:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:57,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:17:57,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:17:57,885 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 09:17:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:58,077 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-28 09:17:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:17:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 41 [2022-04-28 09:17:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 09:17:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 09:17:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 09:17:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 09:17:58,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-28 09:17:58,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:58,092 INFO L225 Difference]: With dead ends: 43 [2022-04-28 09:17:58,092 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:17:58,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:17:58,093 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:58,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:17:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:17:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:17:58,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:58,093 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 09:17:58,093 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 09:17:58,093 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 09:17:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:58,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:17:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:17:58,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:58,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:58,094 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 09:17:58,094 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 09:17:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:58,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:17:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:17:58,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:58,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:58,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:58,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:58,094 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 09:17:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:17:58,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-04-28 09:17:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:58,094 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:17:58,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 09:17:58,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:17:58,095 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 09:17:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:17:58,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:58,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:17:58,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 09:17:58,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:17:58,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:17:58,496 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:17:58,496 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:17:58,496 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,496 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 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,496 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 24) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 24) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 20) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0)) [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0)) [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 15 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 24) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:17:58,497 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 09:17:58,497 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:17:58,500 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 2, 2] [2022-04-28 09:17:58,510 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:17:58,512 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:17:58,514 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:17:58,522 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:17:58,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:17:58 BoogieIcfgContainer [2022-04-28 09:17:58,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:17:58,530 INFO L158 Benchmark]: Toolchain (without parser) took 21275.96ms. Allocated memory was 195.0MB in the beginning and 287.3MB in the end (delta: 92.3MB). Free memory was 145.4MB in the beginning and 125.8MB in the end (delta: 19.7MB). Peak memory consumption was 112.6MB. Max. memory is 8.0GB. [2022-04-28 09:17:58,530 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:17:58,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.27ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 171.0MB in the end (delta: -25.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-28 09:17:58,531 INFO L158 Benchmark]: Boogie Preprocessor took 25.18ms. Allocated memory is still 195.0MB. Free memory was 171.0MB in the beginning and 169.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:17:58,531 INFO L158 Benchmark]: RCFGBuilder took 194.01ms. Allocated memory is still 195.0MB. Free memory was 169.7MB in the beginning and 159.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:17:58,531 INFO L158 Benchmark]: TraceAbstraction took 20881.98ms. Allocated memory was 195.0MB in the beginning and 287.3MB in the end (delta: 92.3MB). Free memory was 159.0MB in the beginning and 125.8MB in the end (delta: 33.2MB). Peak memory consumption was 126.6MB. Max. memory is 8.0GB. [2022-04-28 09:17:58,533 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.27ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 171.0MB in the end (delta: -25.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.18ms. Allocated memory is still 195.0MB. Free memory was 171.0MB in the beginning and 169.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 194.01ms. Allocated memory is still 195.0MB. Free memory was 169.7MB in the beginning and 159.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20881.98ms. Allocated memory was 195.0MB in the beginning and 287.3MB in the end (delta: 92.3MB). Free memory was 159.0MB in the beginning and 125.8MB in the end (delta: 33.2MB). Peak memory consumption was 126.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 17, TraceHistogramMax: 15, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2197 IncrementalHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 207 mSDtfsCounter, 2197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 710 SyntacticMatches, 28 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=16, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 115 PreInvPairs, 184 NumberOfFragments, 62 HoareAnnotationTreeSize, 115 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1017 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 15]: Loop Invariant Derived loop invariant: x % 4294967296 < 65520 || x % 2 == 0 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:17:58,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...