/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/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:28:56,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:28:56,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:28:56,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:28:56,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:28:56,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:28:56,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:28:56,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:28:56,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:28:56,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:28:56,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:28:56,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:28:56,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:28:56,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:28:56,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:28:56,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:28:56,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:28:56,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:28:56,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:28:56,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:28:56,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:28:56,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:28:56,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:28:56,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:28:56,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:28:56,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:28:56,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:28:56,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:28:56,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:28:56,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:28:56,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:28:56,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:28:56,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:28:56,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:28:56,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:28:56,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:28:56,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:28:56,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:28:56,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:28:56,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:28:56,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:28:56,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:28:56,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:28:56,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:28:56,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:28:56,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:28:56,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:28:56,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:28:56,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:28:56,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:28:56,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:28:56,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:28:56,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:28:56,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:28:56,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:28:56,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:28:56,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:28:56,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:28:56,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:56,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:28:56,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:28:56,826 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:28:56,826 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:28:56,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:28:56,826 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:28:56,826 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:28:57,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:28:57,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:28:57,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:28:57,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:28:57,122 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:28:57,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-28 10:28:57,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31ae3f3a/7448461b9fae489492b2f0f56aa22310/FLAGec09b3fd6 [2022-04-28 10:28:57,602 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:28:57,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-28 10:28:57,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31ae3f3a/7448461b9fae489492b2f0f56aa22310/FLAGec09b3fd6 [2022-04-28 10:28:58,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31ae3f3a/7448461b9fae489492b2f0f56aa22310 [2022-04-28 10:28:58,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:28:58,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:28:58,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:58,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:28:58,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:28:58,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3cb5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58, skipping insertion in model container [2022-04-28 10:28:58,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:28:58,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:28:58,233 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/sumt7.c[403,416] [2022-04-28 10:28:58,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:58,276 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:28:58,287 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/sumt7.c[403,416] [2022-04-28 10:28:58,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:58,322 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:28:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58 WrapperNode [2022-04-28 10:28:58,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:58,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:28:58,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:28:58,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:28:58,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:28:58,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:28:58,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:28:58,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:28:58,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (1/1) ... [2022-04-28 10:28:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:58,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:28:58,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:28:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:28:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:28:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:28:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:28:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:28:58,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:28:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:28:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:28:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:28:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:28:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:28:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:28:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:28:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:28:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:28:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:28:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:28:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:28:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:28:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:28:58,516 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:28:58,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:29:07,415 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:29:07,419 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:29:07,419 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:29:07,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:29:07 BoogieIcfgContainer [2022-04-28 10:29:07,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:29:07,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:29:07,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:29:07,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:29:07,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:28:58" (1/3) ... [2022-04-28 10:29:07,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d91d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:29:07, skipping insertion in model container [2022-04-28 10:29:07,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:58" (2/3) ... [2022-04-28 10:29:07,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d91d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:29:07, skipping insertion in model container [2022-04-28 10:29:07,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:29:07" (3/3) ... [2022-04-28 10:29:07,432 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2022-04-28 10:29:07,445 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:29:07,446 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:29:07,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:29:07,497 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61a4f3ce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@652fd5da [2022-04-28 10:29:07,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:29:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:29:07,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:07,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:07,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 1 times [2022-04-28 10:29:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654262235] [2022-04-28 10:29:07,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:29:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 2 times [2022-04-28 10:29:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475450470] [2022-04-28 10:29:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:08,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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; {30#true} is VALID [2022-04-28 10:29:08,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 10:29:08,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-28 10:29:08,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {40#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:08,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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; {30#true} is VALID [2022-04-28 10:29:08,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 10:29:08,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-28 10:29:08,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-28 10:29:08,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:08,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:08,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:08,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:08,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {37#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:08,299 INFO L272 TraceCheckUtils]: 10: Hoare triple {37#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:29:08,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:29:08,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31#false} is VALID [2022-04-28 10:29:08,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-28 10:29:08,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-28 10:29:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:08,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475450470] [2022-04-28 10:29:08,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475450470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:08,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:08,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:29:08,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654262235] [2022-04-28 10:29:08,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654262235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:08,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:08,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:29:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071852339] [2022-04-28 10:29:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-28 10:29:08,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:08,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:08,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:29:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:29:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:29:08,368 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:10,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:17,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:21,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:26,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:28,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:30,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:32,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:36,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:39,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:43,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:43,999 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-28 10:29:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:29:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-28 10:29:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 10:29:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 10:29:44,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-28 10:29:44,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:44,153 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:29:44,153 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:29:44,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:29:44,167 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:44,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 20.8s Time] [2022-04-28 10:29:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:29:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-28 10:29:44,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:44,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:44,203 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:44,204 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:44,207 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 10:29:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 10:29:44,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:44,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:44,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 10:29:44,209 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 10:29:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:44,212 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 10:29:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 10:29:44,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:44,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:44,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:44,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-28 10:29:44,216 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2022-04-28 10:29:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:44,217 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-28 10:29:44,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:44,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-28 10:29:44,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-28 10:29:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:29:44,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:44,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:44,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:29:44,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 1 times [2022-04-28 10:29:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287326275] [2022-04-28 10:29:44,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:29:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 2 times [2022-04-28 10:29:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:44,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306091106] [2022-04-28 10:29:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:44,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(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; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:44,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:44,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {305#true} #81#return; {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:44,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {313#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:44,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(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; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:44,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:29:44,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {305#true} #81#return; {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:44,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:44,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {311#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:29:44,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {312#(= main_~l~0 0)} is VALID [2022-04-28 10:29:44,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {312#(= main_~l~0 0)} is VALID [2022-04-28 10:29:44,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {306#false} is VALID [2022-04-28 10:29:44,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {306#false} is VALID [2022-04-28 10:29:44,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} ~l~0 := 1 + ~l~0; {306#false} is VALID [2022-04-28 10:29:44,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {306#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {306#false} is VALID [2022-04-28 10:29:44,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2022-04-28 10:29:44,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2022-04-28 10:29:44,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-28 10:29:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:44,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306091106] [2022-04-28 10:29:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306091106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:44,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:44,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:44,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287326275] [2022-04-28 10:29:44,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287326275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:44,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:44,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293658656] [2022-04-28 10:29:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 15 [2022-04-28 10:29:44,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:44,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:46,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:46,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:29:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:29:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:29:46,922 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:53,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:57,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:02,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:06,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:06,761 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 10:30:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 15 [2022-04-28 10:30:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:30:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 10:30:06,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-28 10:30:08,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:08,988 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:30:08,988 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:30:08,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:30:08,989 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:08,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 10:30:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:30:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:30:09,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:09,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:09,047 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:09,047 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:09,049 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 10:30:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 10:30:09,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:09,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:09,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 10:30:09,050 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 10:30:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:09,052 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 10:30:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 10:30:09,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:09,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:09,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:09,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-28 10:30:09,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2022-04-28 10:30:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:09,056 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-28 10:30:09,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:09,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-28 10:30:09,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 10:30:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:30:09,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:09,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:30:09,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 1 times [2022-04-28 10:30:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264536494] [2022-04-28 10:30:10,814 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:10,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 2 times [2022-04-28 10:30:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139283965] [2022-04-28 10:30:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:10,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:10,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(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; {531#true} is VALID [2022-04-28 10:30:10,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 10:30:10,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-28 10:30:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 10:30:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:11,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#true} ~cond := #in~cond; {531#true} is VALID [2022-04-28 10:30:11,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume !(0 == ~cond); {531#true} is VALID [2022-04-28 10:30:11,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 10:30:11,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {531#true} {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #79#return; {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:11,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {542#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:11,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(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; {531#true} is VALID [2022-04-28 10:30:11,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 10:30:11,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-28 10:30:11,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret5 := main(); {531#true} is VALID [2022-04-28 10:30:11,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {531#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {536#(= main_~l~0 0)} is VALID [2022-04-28 10:30:11,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {536#(= main_~l~0 0)} is VALID [2022-04-28 10:30:11,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {536#(= main_~l~0 0)} is VALID [2022-04-28 10:30:11,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {536#(= main_~l~0 0)} is VALID [2022-04-28 10:30:11,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:11,029 INFO L272 TraceCheckUtils]: 10: Hoare triple {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {531#true} is VALID [2022-04-28 10:30:11,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {531#true} ~cond := #in~cond; {531#true} is VALID [2022-04-28 10:30:11,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {531#true} assume !(0 == ~cond); {531#true} is VALID [2022-04-28 10:30:11,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 10:30:11,030 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {531#true} {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #79#return; {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:11,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:11,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {537#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {532#false} is VALID [2022-04-28 10:30:11,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {532#false} ~l~0 := 1 + ~l~0; {532#false} is VALID [2022-04-28 10:30:11,035 INFO L272 TraceCheckUtils]: 18: Hoare triple {532#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {532#false} is VALID [2022-04-28 10:30:11,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#false} ~cond := #in~cond; {532#false} is VALID [2022-04-28 10:30:11,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#false} assume 0 == ~cond; {532#false} is VALID [2022-04-28 10:30:11,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-04-28 10:30:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:11,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139283965] [2022-04-28 10:30:11,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139283965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:11,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052532307] [2022-04-28 10:30:11,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:11,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process