/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/sumt2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:25:52,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:25:52,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:25:52,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:25:52,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:25:52,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:25:52,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:25:52,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:25:52,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:25:52,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:25:52,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:25:52,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:25:52,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:25:52,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:25:52,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:25:52,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:25:52,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:25:52,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:25:52,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:25:52,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:25:52,546 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:25:52,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:25:52,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:25:52,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:25:52,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:25:52,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:25:52,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:25:52,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:25:52,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:25:52,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:25:52,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:25:52,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:25:52,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:25:52,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:25:52,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:25:52,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:25:52,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:25:52,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:25:52,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:25:52,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:25:52,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:25:52,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:25:52,567 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:25:52,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:25:52,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:25:52,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:25:52,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:25:52,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:25:52,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:25:52,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:25:52,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:25:52,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:25:52,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:25:52,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:25:52,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:25:52,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:25:52,583 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:25:52,583 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:25:52,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:25:52,583 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:25:52,583 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:25:52,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:25:52,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:25:52,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:25:52,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:25:52,864 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:25:52,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-08 10:25:52,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ecf31c5/3a17945af64a4792bd6bb703cb1bb7f3/FLAGbf987d32f [2022-04-08 10:25:53,335 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:25:53,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-08 10:25:53,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ecf31c5/3a17945af64a4792bd6bb703cb1bb7f3/FLAGbf987d32f [2022-04-08 10:25:53,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ecf31c5/3a17945af64a4792bd6bb703cb1bb7f3 [2022-04-08 10:25:53,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:25:53,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:25:53,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:25:53,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:25:53,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:25:53,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576d9baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53, skipping insertion in model container [2022-04-08 10:25:53,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:25:53,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:25:53,907 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/sumt2.c[403,416] [2022-04-08 10:25:53,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:25:53,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:25:53,949 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/sumt2.c[403,416] [2022-04-08 10:25:53,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:25:53,965 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:25:53,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53 WrapperNode [2022-04-08 10:25:53,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:25:53,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:25:53,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:25:53,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:25:53,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:53,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:25:54,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:25:54,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:25:54,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:25:54,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (1/1) ... [2022-04-08 10:25:54,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:25:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:25:54,033 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:25:54,055 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:25:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:25:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:25:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:25:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:25:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:25:54,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:25:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:25:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:25:54,135 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:25:54,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:25:54,321 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:25:54,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:25:54,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:25:54,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:25:54 BoogieIcfgContainer [2022-04-08 10:25:54,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:25:54,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:25:54,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:25:54,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:25:54,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:25:53" (1/3) ... [2022-04-08 10:25:54,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431796f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:25:54, skipping insertion in model container [2022-04-08 10:25:54,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:25:53" (2/3) ... [2022-04-08 10:25:54,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431796f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:25:54, skipping insertion in model container [2022-04-08 10:25:54,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:25:54" (3/3) ... [2022-04-08 10:25:54,349 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt2.c [2022-04-08 10:25:54,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:25:54,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:25:54,428 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:25:54,450 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:25:54,450 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:25:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:25:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:25:54,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:54,477 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:54,478 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 410732699, now seen corresponding path program 1 times [2022-04-08 10:25:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78118147] [2022-04-08 10:25:54,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:25:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 410732699, now seen corresponding path program 2 times [2022-04-08 10:25:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:54,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712624391] [2022-04-08 10:25:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:54,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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; {25#true} is VALID [2022-04-08 10:25:54,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:25:54,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 10:25:54,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:25:54,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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; {25#true} is VALID [2022-04-08 10:25:54,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 10:25:54,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-08 10:25:54,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 10:25:54,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-08 10:25:54,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {25#true} is VALID [2022-04-08 10:25:54,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 10:25:54,715 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {26#false} is VALID [2022-04-08 10:25:54,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 10:25:54,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 10:25:54,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 10:25:54,717 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:25:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:54,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712624391] [2022-04-08 10:25:54,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712624391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:54,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:54,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:25:54,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78118147] [2022-04-08 10:25:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78118147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:54,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:54,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:25:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872587913] [2022-04-08 10:25:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:54,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,756 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:25:54,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:25:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:25:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:25:54,784 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:54,901 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:25:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:25:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 10:25:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-08 10:25:54,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-08 10:25:54,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:54,981 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:25:54,981 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:25:54,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:25:54,987 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:54,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:25:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:25:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:25:55,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:55,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,017 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,017 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:55,020 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 10:25:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:25:55,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:55,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:55,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:25:55,021 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:25:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:55,023 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 10:25:55,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:25:55,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:55,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:55,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:55,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 10:25:55,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-08 10:25:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:55,032 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 10:25:55,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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:25:55,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 10:25:55,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:25:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:25:55,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:55,060 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:55,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:25:55,060 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 400573968, now seen corresponding path program 1 times [2022-04-08 10:25:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567716090] [2022-04-08 10:25:55,064 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:25:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 400573968, now seen corresponding path program 2 times [2022-04-08 10:25:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:55,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475101293] [2022-04-08 10:25:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:25:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:55,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(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; {161#true} is VALID [2022-04-08 10:25:55,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 10:25:55,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-08 10:25:55,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {169#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:25:55,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(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; {161#true} is VALID [2022-04-08 10:25:55,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 10:25:55,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-08 10:25:55,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret5 := main(); {161#true} is VALID [2022-04-08 10:25:55,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {161#true} is VALID [2022-04-08 10:25:55,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:25:55,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:25:55,302 INFO L272 TraceCheckUtils]: 8: Hoare triple {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {167#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:25:55,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {168#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:25:55,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-08 10:25:55,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 10:25:55,303 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:25:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:55,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475101293] [2022-04-08 10:25:55,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475101293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:55,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:55,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:25:55,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:55,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567716090] [2022-04-08 10:25:55,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567716090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:55,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:55,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:25:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495350819] [2022-04-08 10:25:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:55,306 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:25:55,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:55,307 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:25:55,327 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:25:55,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:25:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:25:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:25:55,329 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. 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:25:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:55,492 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 10:25:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:25:55,493 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:25:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:55,493 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:25:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 10:25:55,495 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:25:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 10:25:55,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-08 10:25:55,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:55,535 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:25:55,535 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:25:55,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:25:55,539 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:55,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:25:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:25:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:25:55,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:55,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,551 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,552 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:55,554 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 10:25:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 10:25:55,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:55,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:55,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:25:55,555 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:25:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:55,556 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 10:25:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 10:25:55,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:55,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:55,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:55,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:25:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-08 10:25:55,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2022-04-08 10:25:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:55,565 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-08 10:25:55,565 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:25:55,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-08 10:25:55,585 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:25:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 10:25:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:25:55,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:25:55,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:25:55,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:25:55,587 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:25:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:25:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1582670899, now seen corresponding path program 1 times [2022-04-08 10:25:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:55,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978175537] [2022-04-08 10:25:55,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:25:55,614 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:25:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1582670899, now seen corresponding path program 2 times [2022-04-08 10:25:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:25:55,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469007892] [2022-04-08 10:25:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:25:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:25:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:25:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:56,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#(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; {302#true} is VALID [2022-04-08 10:25:56,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-08 10:25:56,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-08 10:25:56,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {314#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:25:56,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(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; {302#true} is VALID [2022-04-08 10:25:56,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-08 10:25:56,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-08 10:25:56,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2022-04-08 10:25:56,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {302#true} is VALID [2022-04-08 10:25:56,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:25:56,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {308#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-08 10:25:56,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~i~0 := 1 + ~i~0; {309#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-08 10:25:56,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} ~l~0 := 1 + ~l~0; {310#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-08 10:25:56,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {311#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:25:56,111 INFO L272 TraceCheckUtils]: 11: Hoare triple {311#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:25:56,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {313#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:25:56,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {313#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {303#false} is VALID [2022-04-08 10:25:56,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-04-08 10:25:56,113 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:25:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:25:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469007892] [2022-04-08 10:25:56,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469007892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:25:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081283207] [2022-04-08 10:25:56,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:25:56,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:25:56,120 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:25:56,149 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:25:56,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:25:56,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:25:56,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:25:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:25:56,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:25:56,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {302#true} is VALID [2022-04-08 10:25:56,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#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; {302#true} is VALID [2022-04-08 10:25:56,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-08 10:25:56,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-08 10:25:56,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2022-04-08 10:25:56,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {302#true} is VALID [2022-04-08 10:25:56,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:25:56,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:25:56,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~i~0 := 1 + ~i~0; {342#(and (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:25:56,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(and (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {346#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:25:56,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {346#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {346#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:25:56,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {346#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:25:56,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:25:56,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {303#false} is VALID [2022-04-08 10:25:56,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-04-08 10:25:56,400 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:25:56,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:25:56,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-04-08 10:25:56,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {303#false} is VALID [2022-04-08 10:25:56,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:25:56,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:25:56,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:25:56,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:25:56,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(= (mod (+ main_~i~0 main_~j~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;~i~0 := 1 + ~i~0; {380#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:25:56,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:25:56,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {373#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:25:56,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {302#true} is VALID [2022-04-08 10:25:56,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2022-04-08 10:25:56,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-08 10:25:56,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-08 10:25:56,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#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; {302#true} is VALID [2022-04-08 10:25:56,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {302#true} is VALID [2022-04-08 10:25:56,634 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:25:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081283207] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:25:56,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:25:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-08 10:25:56,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:25:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978175537] [2022-04-08 10:25:56,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978175537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:25:56,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:25:56,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:25:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652567377] [2022-04-08 10:25:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:25:56,636 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:25:56,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:25:56,636 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:25:56,680 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:25:56,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:25:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:25:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:25:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:25:56,682 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 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:25:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:56,878 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 10:25:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:25:56,878 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:25:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:25:56,879 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:25:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-08 10:25:56,880 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:25:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-08 10:25:56,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 16 transitions. [2022-04-08 10:25:56,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:25:56,951 INFO L225 Difference]: With dead ends: 17 [2022-04-08 10:25:56,951 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:25:56,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:25:56,952 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:25:56,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:25:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:25:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:25:56,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:25:56,954 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:25:56,954 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:25:56,954 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:25:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:56,954 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:25:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:25:56,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:56,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:56,954 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:25:56,955 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:25:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:25:56,955 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:25:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:25:56,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:56,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:25:56,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:25:56,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:25:56,955 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:25:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:25:56,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-08 10:25:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:25:56,956 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:25:56,956 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:25:56,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:25:56,956 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:25:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:25:56,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:25:56,959 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:25:56,987 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:25:57,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:25:57,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:25:57,260 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 10:25:57,260 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 10:25:57,260 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 10:25:57,260 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:25:57,262 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 10:25:57,262 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:25:57,262 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:25:57,262 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-08 10:25:57,262 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 33) the Hoare annotation is: true [2022-04-08 10:25:57,263 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 28) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:25:57,263 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 33) the Hoare annotation is: true [2022-04-08 10:25:57,263 INFO L878 garLoopResultBuilder]: At program point L25-2(lines 25 28) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296)) [2022-04-08 10:25:57,263 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:25:57,263 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:25:57,263 INFO L885 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2022-04-08 10:25:57,263 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 33) the Hoare annotation is: true [2022-04-08 10:25:57,263 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,264 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:25:57,264 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,264 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,266 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,267 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,268 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:25:57,268 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-08 10:25:57,268 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:25:57,268 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-08 10:25:57,268 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:25:57,268 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-08 10:25:57,268 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:25:57,271 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 10:25:57,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:25:57,276 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:25:57,277 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 10:25:57,278 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:25:57,278 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:25:57,279 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:25:57,280 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 10:25:57,335 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:25:57,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:25:57 BoogieIcfgContainer [2022-04-08 10:25:57,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:25:57,345 INFO L158 Benchmark]: Toolchain (without parser) took 3606.03ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.1MB in the beginning and 111.5MB in the end (delta: 14.6MB). Peak memory consumption was 49.8MB. Max. memory is 8.0GB. [2022-04-08 10:25:57,345 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:25:57,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.33ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.9MB in the beginning and 190.9MB in the end (delta: -65.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-08 10:25:57,346 INFO L158 Benchmark]: Boogie Preprocessor took 32.81ms. Allocated memory is still 213.9MB. Free memory was 190.9MB in the beginning and 189.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:25:57,346 INFO L158 Benchmark]: RCFGBuilder took 329.36ms. Allocated memory is still 213.9MB. Free memory was 189.4MB in the beginning and 178.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 10:25:57,346 INFO L158 Benchmark]: TraceAbstraction took 3013.16ms. Allocated memory is still 213.9MB. Free memory was 178.4MB in the beginning and 111.5MB in the end (delta: 66.9MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2022-04-08 10:25:57,348 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.15ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.33ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.9MB in the beginning and 190.9MB in the end (delta: -65.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.81ms. Allocated memory is still 213.9MB. Free memory was 190.9MB in the beginning and 189.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 329.36ms. Allocated memory is still 213.9MB. Free memory was 189.4MB in the beginning and 178.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3013.16ms. Allocated memory is still 213.9MB. Free memory was 178.4MB in the beginning and 111.5MB in the end (delta: 66.9MB). Peak memory consumption was 66.4MB. 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 40 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 40 PreInvPairs, 58 NumberOfFragments, 85 HoareAnnotationTreeSize, 40 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (i + j) % 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: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 10:25:57,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...