/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:01:26,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:01:26,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:01:26,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:01:26,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:01:26,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:01:26,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:01:26,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:01:26,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:01:26,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:01:26,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:01:26,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:01:26,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:01:26,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:01:26,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:01:26,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:01:26,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:01:26,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:01:26,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:01:26,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:01:26,684 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:01:26,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:01:26,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:01:26,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:01:26,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:01:26,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:01:26,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:01:26,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:01:26,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:01:26,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:01:26,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:01:26,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:01:26,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:01:26,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:01:26,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:01:26,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:01:26,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:01:26,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:01:26,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:01:26,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:01:26,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:01:26,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:01:26,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:01:26,727 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:01:26,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:01:26,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:01:26,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:01:26,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:01:26,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:01:26,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:01:26,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:01:26,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:01:26,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:01:26,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:01:26,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:01:26,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:01:26,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:01:26,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:01:26,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:01:26,732 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:01:26,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:01:26,733 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:01:26,733 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 04:01:26,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:01:27,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:01:27,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:01:27,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:01:27,008 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:01:27,009 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 04:01:27,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd3e5d6/d3930dae0ca245e4a409a61a71278582/FLAG64dc94b63 [2022-04-28 04:01:27,518 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:01:27,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-28 04:01:27,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd3e5d6/d3930dae0ca245e4a409a61a71278582/FLAG64dc94b63 [2022-04-28 04:01:27,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd3e5d6/d3930dae0ca245e4a409a61a71278582 [2022-04-28 04:01:27,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:01:27,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:01:27,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:01:27,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:01:27,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:01:27,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bced1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27, skipping insertion in model container [2022-04-28 04:01:27,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:01:27,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:01:27,683 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 04:01:27,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:01:27,748 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:01:27,758 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 04:01:27,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:01:27,777 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:01:27,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27 WrapperNode [2022-04-28 04:01:27,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:01:27,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:01:27,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:01:27,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:01:27,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:01:27,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:01:27,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:01:27,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:01:27,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (1/1) ... [2022-04-28 04:01:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:01:27,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:27,869 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 04:01:27,895 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 04:01:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:01:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:01:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:01:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:01:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:01:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:01:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:01:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:01:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:01:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:01:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:01:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:01:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:01:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:01:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:01:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:01:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:01:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:01:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:01:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:01:27,977 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:01:27,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:01:36,859 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:01:36,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:01:36,866 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:01:36,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:01:36 BoogieIcfgContainer [2022-04-28 04:01:36,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:01:36,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:01:36,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:01:36,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:01:36,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:01:27" (1/3) ... [2022-04-28 04:01:36,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc79430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:01:36, skipping insertion in model container [2022-04-28 04:01:36,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:01:27" (2/3) ... [2022-04-28 04:01:36,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc79430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:01:36, skipping insertion in model container [2022-04-28 04:01:36,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:01:36" (3/3) ... [2022-04-28 04:01:36,881 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2022-04-28 04:01:36,892 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:01:36,892 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:01:36,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:01:36,935 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@3f15f4da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b19983e [2022-04-28 04:01:36,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:01:36,943 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 04:01:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:01:36,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:36,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:36,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 1 times [2022-04-28 04:01:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:36,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927361151] [2022-04-28 04:01:36,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:01:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 2 times [2022-04-28 04:01:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511766707] [2022-04-28 04:01:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:37,805 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 04:01:37,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 04:01:37,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-28 04:01:37,808 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 04:01:37,808 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 04:01:37,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 04:01:37,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-28 04:01:37,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-28 04:01:37,810 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 04:01:37,811 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 04:01:37,812 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 04:01:37,814 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 04:01:37,816 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 04:01:37,818 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 04:01:37,819 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 04:01:37,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31#false} is VALID [2022-04-28 04:01:37,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-28 04:01:37,823 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 04:01:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:37,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511766707] [2022-04-28 04:01:37,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511766707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:37,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:37,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:01:37,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:01:37,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927361151] [2022-04-28 04:01:37,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927361151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:37,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:37,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:01:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872478752] [2022-04-28 04:01:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:01:37,838 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 04:01:37,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:01:37,843 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 04:01:37,866 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 04:01:37,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:01:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:01:37,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:01:37,897 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 04:01:40,233 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 04:01:46,840 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 04:01:51,170 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 04:01:55,617 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 04:01:57,782 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 04:02:02,108 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 04:02:06,537 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 04:02:08,700 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 04:02:10,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:02:13,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:02:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:13,486 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-28 04:02:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:02:13,487 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 04:02:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:13,489 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 04:02:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 04:02:13,502 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 04:02:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-28 04:02:13,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-28 04:02:13,609 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 04:02:13,617 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:02:13,617 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:02:13,619 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 04:02:13,621 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 04:02:13,622 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 04:02:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:02:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-28 04:02:13,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:13,670 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 04:02:13,670 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 04:02:13,671 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 04:02:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:13,677 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 04:02:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 04:02:13,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:13,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:13,679 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 04:02:13,681 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 04:02:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:13,692 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 04:02:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-28 04:02:13,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:13,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:13,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:13,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:13,696 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 04:02:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-28 04:02:13,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2022-04-28 04:02:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:13,700 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-28 04:02:13,700 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 04:02:13,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-28 04:02:13,761 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 04:02:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-28 04:02:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:02:13,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:13,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:02:13,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 1 times [2022-04-28 04:02:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:13,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089115943] [2022-04-28 04:02:13,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:02:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 2 times [2022-04-28 04:02:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:13,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306815896] [2022-04-28 04:02:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:14,160 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 04:02:14,161 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 04:02:14,162 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 04:02:14,163 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 04:02:14,164 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 04:02:14,164 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 04:02:14,165 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 04:02:14,166 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 04:02:14,167 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 04:02:14,168 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 04:02:14,168 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 04:02:14,169 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 04:02:14,169 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 04:02:14,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} ~l~0 := 1 + ~l~0; {306#false} is VALID [2022-04-28 04:02:14,169 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 04:02:14,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2022-04-28 04:02:14,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2022-04-28 04:02:14,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-04-28 04:02:14,170 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 04:02:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306815896] [2022-04-28 04:02:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306815896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:14,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:14,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:02:14,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089115943] [2022-04-28 04:02:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089115943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:14,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:14,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:02:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847522660] [2022-04-28 04:02:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:14,173 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 04:02:14,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:14,173 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 04:02:16,366 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 04:02:16,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:02:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:16,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:02:16,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:02:16,368 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 04:02:22,902 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 04:02:33,795 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 04:02:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:33,992 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 04:02:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:02:33,992 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 04:02:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:33,993 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 04:02:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 04:02:33,995 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 04:02:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 04:02:33,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-28 04:02:36,214 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 04:02:36,215 INFO L225 Difference]: With dead ends: 45 [2022-04-28 04:02:36,215 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:02:36,216 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 04:02:36,217 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 26 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:02:36,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 04:02:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:02:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 04:02:36,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:36,272 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 04:02:36,272 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 04:02:36,272 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 04:02:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:36,274 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 04:02:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 04:02:36,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:36,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:36,275 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 04:02:36,275 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 04:02:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:36,277 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 04:02:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 04:02:36,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:36,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:36,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:36,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:36,278 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 04:02:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-28 04:02:36,280 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2022-04-28 04:02:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:36,280 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-28 04:02:36,280 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 04:02:36,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-28 04:02:36,333 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 04:02:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 04:02:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:02:36,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:36,334 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 04:02:36,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:02:36,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 1 times [2022-04-28 04:02:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:36,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928058425] [2022-04-28 04:04:11,308 WARN L232 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 136 DAG size of output: 43 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:04:15,542 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:04:19,840 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:04:21,965 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-28 04:04:26,268 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:06:29,200 WARN L232 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 136 DAG size of output: 43 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:06:29,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:06:29,225 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 738488328, now seen corresponding path program 1 times [2022-04-28 04:06:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:29,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518242578] [2022-04-28 04:06:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:29,625 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 04:06:29,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 04:06:29,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-28 04:06:29,626 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 04:06:29,627 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 04:06:29,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2022-04-28 04:06:29,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #81#return; {531#true} is VALID [2022-04-28 04:06:29,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret5 := main(); {531#true} is VALID [2022-04-28 04:06:29,628 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#(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 04:06:29,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#(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); {536#(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 04:06:29,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(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))} [85] L38-1-->L23_primed: Formula: (let ((.cse5 (mod v_main_~l~0_23 4294967296))) (let ((.cse1 (= (mod (mod .cse5 7) 4294967296) 0)) (.cse0 (= (mod (+ v_main_~l~0_23 1) 4294967296) (mod (+ v_main_~v1~0_9 v_main_~v2~0_8 v_main_~v3~0_8 v_main_~v4~0_8 v_main_~i~0_8 v_main_~j~0_8 v_main_~k~0_8 1) 4294967296))) (.cse2 (< .cse5 (mod v_main_~n~0_7 4294967296))) (.cse3 (= v_main_~v1~0_9 v_main_~v1~0_8)) (.cse4 (= v_main_~l~0_23 v_main_~l~0_22))) (or (and .cse0 .cse1 (< v_main_~v1~0_8 (+ v_main_~v1~0_9 2)) .cse2 (= (+ v_main_~l~0_23 v_main_~v1~0_8) (+ v_main_~l~0_22 v_main_~v1~0_9)) (< v_main_~v1~0_9 v_main_~v1~0_8)) (and .cse3 .cse4 (or (not .cse1) (not .cse0) (not .cse2))) (and (= v_main_~v4~0_8 v_main_~v4~0_8) (= v_main_~i~0_8 v_main_~i~0_8) (= v_main_~j~0_8 v_main_~j~0_8) .cse3 .cse4 (= v_main_~v3~0_8 v_main_~v3~0_8) (= v_main_~n~0_7 v_main_~n~0_7) (= v_main_~v2~0_8 v_main_~v2~0_8) (= v_main_~k~0_8 v_main_~k~0_8))))) InVars {main_~l~0=v_main_~l~0_23, main_~v1~0=v_main_~v1~0_9, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_22, main_~v1~0=v_main_~v1~0_8, main_~v2~0=v_main_~v2~0_8, main_~k~0=v_main_~k~0_8, main_~v4~0=v_main_~v4~0_8, main_~j~0=v_main_~j~0_8, main_~i~0=v_main_~i~0_8, main_~v3~0=v_main_~v3~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v1~0] {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:06:29,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [84] L23_primed-->L23: Formula: (< (mod v_main_~l~0_12 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_12, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_12, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:06:29,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~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; {538#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 1) main_~v1~0) (= main_~v3~0 0))} is VALID [2022-04-28 04:06:29,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#(and (<= main_~v1~0 (+ main_~l~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 1) main_~v1~0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {539#(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 04:06:29,637 INFO L272 TraceCheckUtils]: 11: Hoare triple {539#(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)); {540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:06:29,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {540#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {541#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:06:29,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {532#false} is VALID [2022-04-28 04:06:29,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-04-28 04:06:29,639 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 04:06:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518242578] [2022-04-28 04:06:29,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518242578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:29,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:29,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:06:49,251 WARN L232 SmtUtils]: Spent 19.26s on a formula simplification. DAG size of input: 37 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:06:49,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:49,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928058425] [2022-04-28 04:06:49,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928058425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:49,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:49,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:06:49,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909437611] [2022-04-28 04:06:49,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 04:06:49,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:49,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:06:49,716 WARN L143 InductivityCheck]: Transition 550#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) ( _ , assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); , 537#(and (<= main_~v1~0 main_~l~0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~l~0 main_~v1~0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0)) ) not inductive [2022-04-28 04:06:49,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:06:49,717 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 04:06:49,721 INFO L158 Benchmark]: Toolchain (without parser) took 322182.79ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 130.2MB in the beginning and 116.0MB in the end (delta: 14.1MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. [2022-04-28 04:06:49,721 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:06:49,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.22ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 130.0MB in the beginning and 240.8MB in the end (delta: -110.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-28 04:06:49,722 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 270.5MB. Free memory was 240.8MB in the beginning and 239.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:06:49,722 INFO L158 Benchmark]: RCFGBuilder took 9041.33ms. Allocated memory is still 270.5MB. Free memory was 239.2MB in the beginning and 225.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 04:06:49,723 INFO L158 Benchmark]: TraceAbstraction took 312850.29ms. Allocated memory is still 270.5MB. Free memory was 224.5MB in the beginning and 116.0MB in the end (delta: 108.5MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-04-28 04:06:49,724 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.14ms. Allocated memory is still 186.6MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.22ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 130.0MB in the beginning and 240.8MB in the end (delta: -110.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 270.5MB. Free memory was 240.8MB in the beginning and 239.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 9041.33ms. Allocated memory is still 270.5MB. Free memory was 239.2MB in the beginning and 225.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 312850.29ms. Allocated memory is still 270.5MB. Free memory was 224.5MB in the beginning and 116.0MB in the end (delta: 108.5MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:06:49,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...