/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/loops-crafted-1/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:26:04,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:26:04,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:26:04,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:26:04,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:26:04,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:26:04,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:26:04,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:26:04,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:26:04,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:26:04,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:26:04,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:26:04,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:26:04,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:26:04,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:26:04,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:26:04,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:26:04,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:26:04,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:26:04,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:26:04,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:26:04,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:26:04,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:26:04,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:26:04,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:26:04,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:26:04,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:26:04,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:26:04,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:26:04,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:26:04,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:26:04,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:26:04,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:26:04,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:26:04,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:26:04,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:26:04,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:26:04,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:26:04,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:26:04,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:26:04,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:26:04,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:26:04,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:26:04,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:26:04,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:26:04,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:26:04,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:26:04,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:26:04,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:04,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:26:04,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:26:04,201 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:26:04,201 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:26:04,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:26:04,201 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:26:04,201 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-08 10:26:04,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:26:04,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:26:04,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:26:04,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:26:04,647 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:26:04,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-08 10:26:04,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b818187ee/4b9a23e2d1b8482e9f37a7852646e5fe/FLAG24f610dde [2022-04-08 10:26:05,412 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:26:05,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-08 10:26:05,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b818187ee/4b9a23e2d1b8482e9f37a7852646e5fe/FLAG24f610dde [2022-04-08 10:26:05,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b818187ee/4b9a23e2d1b8482e9f37a7852646e5fe [2022-04-08 10:26:05,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:26:05,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:26:05,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:05,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:26:05,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:26:05,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:05,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a72805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05, skipping insertion in model container [2022-04-08 10:26:05,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:05,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:26:05,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:26:05,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-08 10:26:05,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:05,920 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:26:05,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-08 10:26:05,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:05,997 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:26:05,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05 WrapperNode [2022-04-08 10:26:05,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:05,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:26:05,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:26:05,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:26:06,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:26:06,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:26:06,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:26:06,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:26:06,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (1/1) ... [2022-04-08 10:26:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:06,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:06,103 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-08 10:26:06,125 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-08 10:26:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:26:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:26:06,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:26:06,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:26:06,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:26:06,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:26:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:26:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:26:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:26:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:26:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:26:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:26:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:26:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:26:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:26:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:26:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:26:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:26:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:26:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:26:06,268 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:26:06,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:26:08,650 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:26:08,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:26:08,657 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:26:08,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:26:08 BoogieIcfgContainer [2022-04-08 10:26:08,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:26:08,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:26:08,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:26:08,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:26:08,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:26:05" (1/3) ... [2022-04-08 10:26:08,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73fd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:26:08, skipping insertion in model container [2022-04-08 10:26:08,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:05" (2/3) ... [2022-04-08 10:26:08,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73fd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:26:08, skipping insertion in model container [2022-04-08 10:26:08,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:26:08" (3/3) ... [2022-04-08 10:26:08,666 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2022-04-08 10:26:08,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:26:08,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:26:08,709 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:26:08,716 INFO L340 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 [2022-04-08 10:26:08,716 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:26:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:26:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:26:08,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:08,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:08,752 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 1 times [2022-04-08 10:26:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:08,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116914347] [2022-04-08 10:26:08,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:26:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 2 times [2022-04-08 10:26:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041486485] [2022-04-08 10:26:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:09,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-08 10:26:09,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:26:09,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-08 10:26:09,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:09,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-08 10:26:09,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 10:26:09,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-08 10:26:09,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-08 10:26:09,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:09,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:09,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:09,508 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:26:09,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:26:09,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-08 10:26:09,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 10:26:09,510 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-08 10:26:09,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:09,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041486485] [2022-04-08 10:26:09,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041486485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:09,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:09,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:09,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:09,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116914347] [2022-04-08 10:26:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116914347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554843374] [2022-04-08 10:26:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2022-04-08 10:26:09,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:09,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:09,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:09,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:26:09,589 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:14,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:18,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:19,099 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 10:26:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:26:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2022-04-08 10:26:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 10:26:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-08 10:26:19,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-08 10:26:19,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:19,240 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:26:19,241 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:26:19,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:26:19,252 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:19,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 10:26:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:26:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:26:19,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:19,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,328 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,328 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:19,333 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 10:26:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 10:26:19,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:19,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:19,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 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-08 10:26:19,335 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 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-08 10:26:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:19,339 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 10:26:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 10:26:19,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:19,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:19,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:19,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-08 10:26:19,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-08 10:26:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:19,354 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-08 10:26:19,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:19,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-08 10:26:19,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 10:26:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:26:19,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:19,399 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:19,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:26:19,399 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1996045709, now seen corresponding path program 1 times [2022-04-08 10:26:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:19,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477395362] [2022-04-08 10:26:19,429 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:19,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1996045709, now seen corresponding path program 2 times [2022-04-08 10:26:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:19,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611521856] [2022-04-08 10:26:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:20,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-08 10:26:20,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 10:26:20,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 10:26:20,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {236#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:20,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-08 10:26:20,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 10:26:20,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 10:26:20,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret5 := main(); {224#true} is VALID [2022-04-08 10:26:20,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:20,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:20,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {230#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-08 10:26:20,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {231#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:20,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} ~l~0 := 1 + ~l~0; {232#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-08 10:26:20,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {233#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-08 10:26:20,501 INFO L272 TraceCheckUtils]: 11: Hoare triple {233#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:26:20,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:26:20,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {225#false} is VALID [2022-04-08 10:26:20,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-08 10:26:20,515 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-08 10:26:20,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:20,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611521856] [2022-04-08 10:26:20,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611521856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:20,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514492498] [2022-04-08 10:26:20,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:20,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:20,527 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-08 10:26:20,596 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-08 10:26:20,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:20,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:20,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:26:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:20,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:21,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-08 10:26:21,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-08 10:26:21,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 10:26:21,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 10:26:21,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret5 := main(); {224#true} is VALID [2022-04-08 10:26:21,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:21,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:21,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:21,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {264#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-08 10:26:21,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} ~l~0 := 1 + ~l~0; {268#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-08 10:26:21,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {268#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-08 10:26:21,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {268#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:21,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:21,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-08 10:26:21,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-08 10:26:21,187 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-08 10:26:21,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:21,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-08 10:26:21,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-08 10:26:21,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:21,725 INFO L272 TraceCheckUtils]: 11: Hoare triple {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:21,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:21,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:21,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {302#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:21,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:21,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:21,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {295#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:21,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret5 := main(); {224#true} is VALID [2022-04-08 10:26:21,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-08 10:26:21,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-08 10:26:21,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-08 10:26:21,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-08 10:26:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:26:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514492498] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:21,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-08 10:26:21,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477395362] [2022-04-08 10:26:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477395362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:21,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555347268] [2022-04-08 10:26:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:21,941 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), 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 15 [2022-04-08 10:26:21,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:21,942 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), 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-08 10:26:21,972 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-08 10:26:21,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:26:21,973 INFO L87 Difference]: Start difference. First operand 19 states and 22 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), 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-08 10:26:24,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:26,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:26,695 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-08 10:26:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:26,696 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), 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 15 [2022-04-08 10:26:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:26,696 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), 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-08 10:26:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:26:26,698 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), 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-08 10:26:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:26:26,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-08 10:26:26,762 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-08 10:26:26,763 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:26:26,763 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:26:26,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:26:26,765 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:26,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 10:26:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:26:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 10:26:26,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:26,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:26,771 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:26,771 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:26,785 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:26:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:26:26,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:26,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:26,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 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-08 10:26:26,791 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 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-08 10:26:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:26,793 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:26:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:26:26,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:26,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:26,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:26,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-08 10:26:26,795 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-08 10:26:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:26,795 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-08 10:26:26,795 INFO L479 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), 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-08 10:26:26,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-08 10:26:26,854 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-08 10:26:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 10:26:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:26:26,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:26,855 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:26,888 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-08 10:26:27,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:27,056 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash 943455295, now seen corresponding path program 1 times [2022-04-08 10:26:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:27,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242911573] [2022-04-08 10:26:27,075 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:27,075 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 943455295, now seen corresponding path program 2 times [2022-04-08 10:26:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188734243] [2022-04-08 10:26:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:27,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:26:27,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:26:27,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {480#true} #66#return; {485#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:26:27,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:27,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:26:27,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:26:27,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {480#true} #66#return; {485#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:26:27,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {485#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:26:27,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {486#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:26:27,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:26:27,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:26:27,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:26:27,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {487#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {488#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-08 10:26:27,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {489#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-08 10:26:27,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {489#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-08 10:26:27,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {481#false} is VALID [2022-04-08 10:26:27,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {481#false} ~l~0 := 1 + ~l~0; {481#false} is VALID [2022-04-08 10:26:27,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {481#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {481#false} is VALID [2022-04-08 10:26:27,481 INFO L272 TraceCheckUtils]: 15: Hoare triple {481#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {481#false} is VALID [2022-04-08 10:26:27,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2022-04-08 10:26:27,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2022-04-08 10:26:27,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-08 10:26:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188734243] [2022-04-08 10:26:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188734243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633364651] [2022-04-08 10:26:27,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:27,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:27,484 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-08 10:26:27,487 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-08 10:26:27,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:27,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:26:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:27,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:28,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2022-04-08 10:26:28,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {480#true} is VALID [2022-04-08 10:26:28,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-08 10:26:28,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #66#return; {480#true} is VALID [2022-04-08 10:26:28,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret5 := main(); {480#true} is VALID [2022-04-08 10:26:28,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:28,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:28,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:28,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {520#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:28,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:28,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:28,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:28,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {534#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:28,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {538#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-08 10:26:28,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {538#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-08 10:26:28,043 INFO L272 TraceCheckUtils]: 15: Hoare triple {538#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:28,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:28,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {481#false} is VALID [2022-04-08 10:26:28,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-08 10:26:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:28,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:28,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#false} assume !false; {481#false} is VALID [2022-04-08 10:26:28,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {481#false} is VALID [2022-04-08 10:26:28,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:28,411 INFO L272 TraceCheckUtils]: 15: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:28,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:28,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {572#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,501 WARN L290 TraceCheckUtils]: 12: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {572#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-08 10:26:30,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {572#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:30,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {565#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:30,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} call #t~ret5 := main(); {480#true} is VALID [2022-04-08 10:26:30,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} #66#return; {480#true} is VALID [2022-04-08 10:26:30,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume true; {480#true} is VALID [2022-04-08 10:26:30,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {480#true} is VALID [2022-04-08 10:26:30,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2022-04-08 10:26:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:26:30,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633364651] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:30,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:30,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 18 [2022-04-08 10:26:30,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:30,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242911573] [2022-04-08 10:26:30,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242911573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:30,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:30,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329234005] [2022-04-08 10:26:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-08 10:26:30,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:30,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 10:26:32,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:32,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:26:32,668 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 10:26:34,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:35,148 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-08 10:26:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-08 10:26:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 10:26:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:26:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 10:26:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:26:35,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-08 10:26:37,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:37,322 INFO L225 Difference]: With dead ends: 31 [2022-04-08 10:26:37,322 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:26:37,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:26:37,324 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:37,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:26:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:26:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-08 10:26:37,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:37,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:37,334 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:37,334 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:37,336 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-08 10:26:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-08 10:26:37,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:37,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:37,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 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-08 10:26:37,337 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 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-08 10:26:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:37,339 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-08 10:26:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-08 10:26:37,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:37,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:37,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:37,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 10:26:37,342 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2022-04-08 10:26:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:37,342 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 10:26:37,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-08 10:26:37,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 10:26:39,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:26:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:26:39,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:39,494 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:39,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 10:26:39,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:26:39,696 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -376560181, now seen corresponding path program 1 times [2022-04-08 10:26:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961647580] [2022-04-08 10:26:39,715 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:39,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash -376560181, now seen corresponding path program 2 times [2022-04-08 10:26:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205272576] [2022-04-08 10:26:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:39,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {776#true} is VALID [2022-04-08 10:26:39,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-08 10:26:39,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #66#return; {776#true} is VALID [2022-04-08 10:26:39,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {783#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:39,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {776#true} is VALID [2022-04-08 10:26:39,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-08 10:26:39,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #66#return; {776#true} is VALID [2022-04-08 10:26:39,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret5 := main(); {776#true} is VALID [2022-04-08 10:26:39,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {781#(= main_~l~0 0)} is VALID [2022-04-08 10:26:39,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {781#(= main_~l~0 0)} is VALID [2022-04-08 10:26:39,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {781#(= main_~l~0 0)} is VALID [2022-04-08 10:26:39,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {781#(= main_~l~0 0)} is VALID [2022-04-08 10:26:39,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:39,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:39,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:39,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:39,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {777#false} is VALID [2022-04-08 10:26:39,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {777#false} ~l~0 := 1 + ~l~0; {777#false} is VALID [2022-04-08 10:26:39,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {777#false} is VALID [2022-04-08 10:26:39,814 INFO L272 TraceCheckUtils]: 16: Hoare triple {777#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {777#false} is VALID [2022-04-08 10:26:39,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2022-04-08 10:26:39,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2022-04-08 10:26:39,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {777#false} assume !false; {777#false} is VALID [2022-04-08 10:26:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:39,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205272576] [2022-04-08 10:26:39,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205272576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:39,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880600718] [2022-04-08 10:26:39,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:39,820 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-08 10:26:39,848 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-08 10:26:39,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:39,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:39,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:26:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:39,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:40,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2022-04-08 10:26:40,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {776#true} is VALID [2022-04-08 10:26:40,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-08 10:26:40,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #66#return; {776#true} is VALID [2022-04-08 10:26:40,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret5 := main(); {776#true} is VALID [2022-04-08 10:26:40,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:40,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:40,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:40,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {802#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {812#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {812#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {829#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:40,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {833#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-08 10:26:40,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {833#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-08 10:26:40,440 INFO L272 TraceCheckUtils]: 16: Hoare triple {833#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= (+ (- 1) main_~l~0) 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:40,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:40,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {777#false} is VALID [2022-04-08 10:26:40,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {777#false} assume !false; {777#false} is VALID [2022-04-08 10:26:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:40,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:40,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {777#false} assume !false; {777#false} is VALID [2022-04-08 10:26:40,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {844#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {777#false} is VALID [2022-04-08 10:26:40,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {840#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {844#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:40,797 INFO L272 TraceCheckUtils]: 16: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {840#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:40,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {867#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:40,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {867#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:40,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {860#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:40,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret5 := main(); {776#true} is VALID [2022-04-08 10:26:40,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #66#return; {776#true} is VALID [2022-04-08 10:26:40,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-08 10:26:40,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {776#true} is VALID [2022-04-08 10:26:40,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2022-04-08 10:26:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:26:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880600718] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:40,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-08 10:26:40,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:40,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961647580] [2022-04-08 10:26:40,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961647580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:40,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:40,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930498459] [2022-04-08 10:26:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:40,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-08 10:26:40,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:40,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:26:40,882 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-08 10:26:40,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:26:40,883 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:26:43,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:45,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:47,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:47,806 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-08 10:26:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:47,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-08 10:26:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:26:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-08 10:26:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:26:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-08 10:26:47,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-08 10:26:47,881 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-08 10:26:47,883 INFO L225 Difference]: With dead ends: 37 [2022-04-08 10:26:47,884 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:26:47,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:26:47,885 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:47,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-08 10:26:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:26:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:26:47,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:47,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,893 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,893 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:47,896 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 10:26:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 10:26:47,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:47,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:47,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:26:47,900 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:26:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:47,902 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 10:26:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 10:26:47,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:47,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:47,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:47,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 10:26:47,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 20 [2022-04-08 10:26:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:47,911 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 10:26:47,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:26:47,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 10:26:52,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 10:26:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:26:52,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:52,400 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:52,418 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-08 10:26:52,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:52,603 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 159815037, now seen corresponding path program 1 times [2022-04-08 10:26:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231609361] [2022-04-08 10:26:52,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:52,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 159815037, now seen corresponding path program 2 times [2022-04-08 10:26:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:52,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296017659] [2022-04-08 10:26:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:52,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1116#true} is VALID [2022-04-08 10:26:52,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 10:26:52,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #66#return; {1116#true} is VALID [2022-04-08 10:26:52,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:52,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1116#true} is VALID [2022-04-08 10:26:52,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 10:26:52,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #66#return; {1116#true} is VALID [2022-04-08 10:26:52,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret5 := main(); {1116#true} is VALID [2022-04-08 10:26:52,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {1121#(= main_~l~0 0)} is VALID [2022-04-08 10:26:52,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {1121#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1121#(= main_~l~0 0)} is VALID [2022-04-08 10:26:52,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {1121#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1121#(= main_~l~0 0)} is VALID [2022-04-08 10:26:52,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {1121#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1121#(= main_~l~0 0)} is VALID [2022-04-08 10:26:52,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:52,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:52,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:52,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:26:52,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1122#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {1117#false} ~l~0 := 1 + ~l~0; {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {1117#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {1117#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {1117#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {1117#false} ~l~0 := 1 + ~l~0; {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1117#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L272 TraceCheckUtils]: 20: Hoare triple {1117#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1117#false} is VALID [2022-04-08 10:26:52,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2022-04-08 10:26:52,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 10:26:52,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 10:26:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:26:52,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296017659] [2022-04-08 10:26:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296017659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121500155] [2022-04-08 10:26:52,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:52,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:52,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:52,728 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-08 10:26:52,729 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-08 10:26:52,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:52,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:52,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:26:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:52,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:53,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 10:26:53,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1116#true} is VALID [2022-04-08 10:26:53,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 10:26:53,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #66#return; {1116#true} is VALID [2022-04-08 10:26:53,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret5 := main(); {1116#true} is VALID [2022-04-08 10:26:53,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:53,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:53,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:26:53,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1152#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1169#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1169#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1183#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-08 10:26:53,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {1187#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-08 10:26:53,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {1187#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1187#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-08 10:26:53,313 INFO L272 TraceCheckUtils]: 20: Hoare triple {1187#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:53,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {1194#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:53,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {1198#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 10:26:53,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 10:26:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:53,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:53,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 10:26:53,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {1198#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 10:26:53,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {1194#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:53,685 INFO L272 TraceCheckUtils]: 20: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:53,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:53,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,784 WARN L290 TraceCheckUtils]: 17: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-08 10:26:55,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:55,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1221#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:55,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {1214#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:55,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret5 := main(); {1116#true} is VALID [2022-04-08 10:26:55,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #66#return; {1116#true} is VALID [2022-04-08 10:26:55,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 10:26:55,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1116#true} is VALID [2022-04-08 10:26:55,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 10:26:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 10:26:55,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121500155] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:55,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:55,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-08 10:26:55,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231609361] [2022-04-08 10:26:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231609361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:55,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:55,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482708467] [2022-04-08 10:26:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 24 [2022-04-08 10:26:55,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:55,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-08 10:26:58,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:58,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:26:58,073 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-08 10:27:00,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:02,580 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 10:27:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:27:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 24 [2022-04-08 10:27:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-08 10:27:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:27:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-08 10:27:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:27:02,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 10:27:04,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:04,759 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:27:04,759 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:27:04,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:27:04,760 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:04,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:27:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:27:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:27:04,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:04,761 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-08 10:27:04,761 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-08 10:27:04,762 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-08 10:27:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:04,780 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:27:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:27:04,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:04,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:04,781 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-08 10:27:04,781 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-08 10:27:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:04,781 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:27:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:27:04,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:04,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:04,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:04,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:04,782 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-08 10:27:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:27:04,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-08 10:27:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:04,784 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:27:04,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-08 10:27:04,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:27:04,784 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-08 10:27:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:27:04,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:04,787 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:27:04,812 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-08 10:27:04,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:04,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 10:27:05,282 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:27:05,283 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:27:05,283 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L27(lines 27 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296)) [2022-04-08 10:27:05,283 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 35) the Hoare annotation is: true [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 32) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:27:05,283 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 32) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:27:05,283 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 35) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 35) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0)) [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-08 10:27:05,284 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:27:05,284 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:27:05,285 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 10:27:05,285 INFO L878 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:27:05,285 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:27:05,288 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-08 10:27:05,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:27:05,292 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:27:05,293 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 10:27:05,294 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:27:05,294 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:27:05,294 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:27:05,297 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 10:27:05,407 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:27:05,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:27:05 BoogieIcfgContainer [2022-04-08 10:27:05,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:27:05,415 INFO L158 Benchmark]: Toolchain (without parser) took 59948.29ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 136.8MB in the beginning and 161.5MB in the end (delta: -24.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-08 10:27:05,422 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:27:05,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.52ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 138.1MB in the end (delta: -1.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-08 10:27:05,423 INFO L158 Benchmark]: Boogie Preprocessor took 73.64ms. Allocated memory is still 165.7MB. Free memory was 138.1MB in the beginning and 136.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 10:27:05,423 INFO L158 Benchmark]: RCFGBuilder took 2585.08ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 125.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:27:05,423 INFO L158 Benchmark]: TraceAbstraction took 56754.57ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 124.5MB in the beginning and 161.9MB in the end (delta: -37.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:27:05,424 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.18ms. Allocated memory is still 165.7MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.52ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 138.1MB in the end (delta: -1.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.64ms. Allocated memory is still 165.7MB. Free memory was 138.1MB in the beginning and 136.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2585.08ms. Allocated memory is still 165.7MB. Free memory was 136.4MB in the beginning and 125.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 56754.57ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 124.5MB in the beginning and 161.9MB in the end (delta: -37.4MB). Peak memory consumption was 1.0MB. 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: 10]: 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 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 20.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 62 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 81 NumberOfFragments, 144 HoareAnnotationTreeSize, 54 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 133 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: 21]: Loop Invariant Derived loop invariant: (i + k + j + v4) % 4294967296 == l % 4294967296 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 10:27:05,444 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...